Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Fast algorithm")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 5836

  • Page / 234
Export

Selection :

  • and

An improved greengard-Rokhlin's fast multipole algorithm for the computation of scattering from many conducting cylindersNAKASHIMA, Norimasa; TATEIBA, Mitsuo.IEEE antennas and propagation society international symposiumNational radio science meeting. 2004, pp 1203-1206, isbn 0-7803-8302-8, 4Vol, 4 p.Conference Paper

A fast algorithm for electrically small composite objectsYUNHUI CHU; WENG CHO CHEW.IEEE antennas and propagation society international symposiumNational radio science meeting. 2004, pp 3960-3963, isbn 0-7803-8302-8, 4Vol, 4 p.Conference Paper

An improvement on tree selection sortJINGCHAO CHEN.Lecture notes in computer science. 2002, pp 194-205, issn 0302-9743, isbn 3-540-43977-3, 12 p.Conference Paper

BatMis: a fast algorithm for k-mismatch mappingTENNAKOON, Chandana; PURBOJATI, Rikky W; SUNG, Wing-Kin et al.Bioinformatics (Oxford. Print). 2012, Vol 28, Num 16, pp 2122-2128, issn 1367-4803, 7 p.Article

Damage Detection for Plate-like Structure Using Matching Pursuits with Chirplet AtomYONGMING FENG; LI ZHOU; ZHEN LI et al.Proceedings of SPIE, the International Society for Optical Engineering. 2011, Vol 7981, issn 0277-786X, isbn 978-0-8194-8543-4, 798128.1-798128.12, 2Conference Paper

A fast algorithm for rectilinear block packing based on selected sequence-pairIKEDA, Akira; KODAMA, Chikaaki; FUJIYOSHI, Kunihiro et al.MWSCAS : Midwest symposium on circuits and systems. 2004, isbn 0-7803-8346-X, 3Vol, Vol I, 437-440Conference Paper

Time-optimal short-circuit evaluation of Boolean expressionsSASSA, M; NAKATA, I.Information processing letters. 1988, Vol 29, Num 1, pp 43-51, issn 0020-0190Article

A high-speed labeling algorithm for raster-scanned typeOKUYAMA, Y; KOBAYASHI, Y; TAKENAGA, H et al.Systems and computers in Japan. 1991, Vol 22, Num 3, pp 43-55, issn 0882-1666, 13 p.Article

Enhancing scatterplots with smoothed densitiesEILERS, Paul H. C; GOEMAN, Jelle J.Bioinformatics (Oxford. Print). 2004, Vol 20, Num 5, pp 623-628, issn 1367-4803, 6 p.Article

Fast algorithms for large-scale periodic structuresLU, Wei-Bing; TIE JUN CUI; QIAN, Zhi-Guo et al.IEEE antennas and propagation society international symposiumNational radio science meeting. 2004, pp 4463-4466, isbn 0-7803-8302-8, 4Vol, 4 p.Conference Paper

A lattice vector quantization using a geometric decompositionCHEN, T.-C.IEEE transactions on communications. 1990, Vol 38, Num 5, pp 704-714, issn 0090-6778Article

A fast algorithm for sorting and counting third-order intermodulation productsFORTES, J. M. P; SAMPAIO-NETO, R.IEEE transactions on communications. 1986, Vol 34, Num 12, pp 1266-1272, issn 0090-6778Conference Paper

A Robust Hierarchical Video Shot Detection MethodDHILLON, Jyoti; KAKKIRALA, Krishna; RAO CHALAMALA, Srinivasa et al.Proceedings of SPIE, the International Society for Optical Engineering. 2011, Vol 8285, issn 0277-786X, isbn 978-0-8194-8932-6, 82851P.1-82851P.7, 3Conference Paper

A fast InSAR raw signal simulation based on GPGPUHE ZHIHUA; YU ANXI; HE FENG et al.Proceedings of SPIE, the International Society for Optical Engineering. 2011, Vol 8285, issn 0277-786X, isbn 978-0-8194-8932-6, 82855O.1-82855O.7, 3Conference Paper

Why Neighbor-Joining WorksMIHAESCU, Radu; LEVY, Dan; PACHTER, Lior et al.Algorithmica. 2009, Vol 54, Num 1, pp 1-24, issn 0178-4617, 24 p.Article

Advanced block size selection algorithm for inter frame coding in H.264/MPEG-4 AVCYU, Andy C; MARTIN, Graham R.International Conference on Image Processing. 2004, isbn 0-7803-8554-3, 5Vol, Vol1, 95-98Conference Paper

The tractability of global constraintsBESSIERE, Christian; HEBRARD, Emmanuel; HNICH, Brahim et al.Lecture notes in computer science. 2004, pp 716-720, issn 0302-9743, isbn 3-540-23241-9, 5 p.Conference Paper

On the rapid computation of various polylogarithmic constantsBAILEY, D; BORWEIN, P; PLOUFFE, S et al.Mathematics of computation. 1997, Vol 66, Num 218, pp 903-913, issn 0025-5718Article

A fast scan-line algorithm for topological filling of well-nested objects in 2.5D digital picturesARQUES, D; GRANGE, O.Theoretical computer science. 1995, Vol 147, Num 1-2, pp 211-248, issn 0304-3975Article

Analysis of quickselect : an algorithm for order statisticsMAHMOUD, H. M; MODARRES, R; SMYTHE, R. T et al.Informatique théorique et applications (Imprimé). 1995, Vol 29, Num 4, pp 255-276, issn 0988-3754Article

A fast algorithm for optimum height-limited alphabetic binary treesLARMORE, L. L; PRZYTYCKA, T. M.SIAM journal on computing (Print). 1994, Vol 23, Num 6, pp 1283-1312, issn 0097-5397Article

A fast time-domain algorithm for the simulation of switching power convertersLUCIANO, A. M; STROLLO, A. G. M.IEEE transactions on power electronics. 1990, Vol 5, Num 3, pp 363-370, issn 0885-8993Article

A fast algorithm for signal extraction, influence and cross-validation in state space modelsKOHN, R; ANSLEY, C. F.Biometrika. 1989, Vol 76, Num 1, pp 65-79, issn 0006-3444, 15 p.Article

Fast algorithm for calculating alphabet-constrained rate-distortion functionsPENZHORN, W. T; KUHN, G. J.Electronics Letters. 1989, Vol 25, Num 13, pp 809-810, issn 0013-5194, 2 p.Article

The center weighted Hadamard transformMOON HO LEE.IEEE transactions on circuits and systems. 1989, Vol 36, Num 9, pp 1247-1249, issn 0098-4094, 3 p.Article

  • Page / 234