Pascal and Francis Bibliographic Databases


Search results

Your search

kw.\*:("Tree structure")


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

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


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

Author Country

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


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

Results 1 to 25 of 3170

  • Page / 127

Selection :

  • and

Resolution on formula-treesSCHMERL, U. R.Acta informatica. 1988, Vol 25, Num 4, pp 425-438, issn 0001-5903Article

Macro tree transducersENGELFRIET, J; VOGLER, H.Journal of computer and system sciences (Print). 1985, Vol 31, Num 1, pp 71-146, issn 0022-0000Article

Tree structures for orthogonal transforms and application to the Hadamard transformVETTERLI, M.Signal processing. 1983, Vol 5, Num 6, pp 473-484, issn 0165-1684Article

Patterns and pattern-matching in trees: an analysisSTEYAERT, J.-M; FLAJOLET, P.Information and control. 1983, Vol 58, Num 1-3, pp 19-58, issn 0019-9958Article

Fast multipole boundary element method using the binary tree structure with tight bounds: application to a calculation of an electrostatic force for the manipulation of a metal micro particleURAGO, Masataka; KOYAMA, Takafumi; TAKAHASHI, Kunio et al.Engineering analysis with boundary elements. 2003, Vol 27, Num 8, pp 835-844, issn 0955-7997, 10 p.Article

Multiple generation text files using overlapping tree structuresBURTON, F. W; HUNTBACH, M. M; KOLLIAS, J. Y. G et al.Computer journal (Print). 1985, Vol 28, Num 4, pp 414-416, issn 0010-4620Article

Simple compact tree storage of a multidimensional arrayVISSCHER, P. B.Computer physics communications. 1984, Vol 31, Num 4, pp 311-318, issn 0010-4655Article

Cryptanalysis of tree-structured ciphersMILLAN, W; DAWSON, E. P; O'CONNOR, L. J et al.Electronics Letters. 1994, Vol 30, Num 12, pp 941-942, issn 0013-5194Article

Dynamic analysis of «tree-like» structures undergoing large motions ― a finite segment approachAMIROUCHE, M. L.Engineering analysis. 1986, Vol 3, Num 2, pp 111-117, issn 0264-682XArticle

Comments on the optimal ordering of tree structuresMARTIN, A. F.Computers & structures. 1985, Vol 21, Num 4, issn 0045-7949, 859Article

A time and space efficient data structure for string searching on large textsCOLUSSI, L; DE COL, A.Information processing letters. 1996, Vol 58, Num 5, pp 217-222, issn 0020-0190Article

Modularity in genetic ProgrammingWOODWARD, John R.Lecture notes in computer science. 2003, pp 254-263, issn 0302-9743, isbn 3-540-00971-X, 10 p.Conference Paper

Tree pattern matching with a more general notion of occurrence of the patternCHAUVE, Cedric.Information processing letters. 2002, Vol 82, Num 4, pp 197-201, issn 0020-0190Article

AB+-tree structure for large quadtreesABEL, D. J.Computer vision, graphics, and image processing. 1984, Vol 27, Num 1, pp 19-31, issn 0734-189XArticle

Optimal speeding up of parallel algorithms based upon the divide-and-conquer strategyTANG, C. Y; LEE, R. C. T.Information sciences. 1984, Vol 32, Num 3, pp 173-186, issn 0020-0255Article

Systèmes d'information: les structures physiques de stockageTRICOT, J.L' Informatique professionnelle. 1984, Num 28, pp 67-85, issn 0750-1080Article

Le dialogue utilisateur-base de données par l'intermédiaire d'un «menu»KRIMOV, S. K.Naučno-tehničeskaâ informaciâ - Vsesoûznyj institut naučnoj i tehničeskoj informacii. Seriâ 2. Informacionnye processy i sistemy. 1984, Num 8, pp 23-25, issn 0548-0027Article

Transfert de données arborescentes dans une architecture distribuée pour Centaur (environnement de programmation pour ASN.1) = Tree transfer in a distributed architecture for Centaur - An ASN.1 programming environment (evolution of the distributed architecture of Centaur : propositions)Dery, A.M.1993, 111 p.Report

Throughput analysis of reservation protocols with tree-type reservation channelOIE, Y; MURO, S; HASEGAWA, T et al.Systems and computers in Japan. 1987, Vol 18, Num 3, pp 79-91, issn 0882-1666Article

Embedding tree structures in VLSI hexagonal arraysGORDON, D; KOREN, I; SILBERMAN, G. M et al.IEEE transactions on computers. 1984, Vol 33, Num 1, pp 104-107, issn 0018-9340Article

Prague dependency treebank : Restoration of deletionsHAJICOVA, E; KRUIJFF-KORBAYOVA, I; SGALL, P et al.Lecture notes in computer science. 1999, Vol 1692, pp 44-49, issn 0302-9743, isbn 3-540-66494-7Conference Paper

Generating new designs using union operationsSHI, Y; YU, P.-L; ZHANG, D et al.Computers & mathematics with applications (1987). 1994, Vol 27, Num 12, pp 105-117, issn 0898-1221Article

Vectorization of tree traversalsHERNQUIST, L.Journal of computational physics (Print). 1990, Vol 87, Num 1, pp 137-147, issn 0021-9991Article

Applications of Fodor's lemma to Vaught's conjectureHOWARD, M.Annals of pure and applied logic. 1989, Vol 42, Num 1, pp 1-19, issn 0168-0072Article

Technique for flexible multidimensional filter designJENKINS, D. A; PARKER, D. W.Electronics Letters. 1983, Vol 19, Num 25-26, pp 1088-1090, issn 0013-5194Article

  • Page / 127