Catalogo Articoli (Spogli Riviste)

HELP
ATTENZIONE: attualmente gli articoli Current Contents (fonte ISI) a partire dall'anno 2002 sono consultabili sulla Risorsa On-Line

Le informazioni sugli articoli di fonte ISI sono coperte da copyright

La ricerca find articoli where soggetti phrase all words 'BINARY TREE' sort by level,fasc_key/DESCEND, pagina_ini_num/ASCEND ha restituito 104 riferimenti
Si mostrano 100 riferimenti a partire da 1
Selezionare un intervallo

Per ulteriori informazioni selezionare i riferimenti di interesse.

    1. Gerstenberg, Julian
      Exchangeable interval hypergraphs and limits of ordered discrete structures

      Annals of probability (Online)
    2. Ota, M; Higa, Y; Ochii, H
      Design of low-delay perfect-reconstruction filter banks using linear programming

      ELECTRONICS AND COMMUNICATIONS IN JAPAN PART II-ELECTRONICS
    3. Lin, JC; Chi, TH; Keh, HC; Liou, AHA
      Embedding of complete binary tree with 2-expansion in a faulty Flexible Hypercube

      JOURNAL OF SYSTEMS ARCHITECTURE
    4. Liu, S; Babbs, CF; Delp, EJ
      Multiresolution detection of spiculated lesions in digital mammograms

      IEEE TRANSACTIONS ON IMAGE PROCESSING
    5. Heun, V; Mayr, EW
      Optimal dynamic embeddings of complete binary trees into hypercubes

      JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING
    6. Takenaga, Y; Nakajima, K; Yajima, S
      Tree-shellability of Boolean functions

      THEORETICAL COMPUTER SCIENCE
    7. Guo, GD; Li, SZ; Chan, KL
      Support vector machines for face recognition

      IMAGE AND VISION COMPUTING
    8. Huang, JM
      A fault-tolerant connected-cycle-based mesh architecture

      JOURNAL OF THE CHINESE INSTITUTE OF ENGINEERS
    9. Hofri, M; Shachnai, H
      Efficient reorganization of binary search trees

      ALGORITHMICA
    10. Prodinger, H
      A q-analogue of the path length of binary search trees

      ALGORITHMICA
    11. Chern, HH; Hwang, HK
      Transitional behaviors of the average cost of quicksort with median-of-(2t+1)

      ALGORITHMICA
    12. Drmota, M
      An analytic approach to the height of binary search trees

      ALGORITHMICA
    13. Averbuch, A; Gaber, I; Roditty, Y
      Low-cost minimum-time line-broadcasting schemes in complete binary trees

      NETWORKS
    14. Fedotov, A; Ryabko, B
      The estimated cost of a search tree on binary words

      IEEE TRANSACTIONS ON INFORMATION THEORY
    15. Tayu, S; Ueno, S
      On embedding binary trees into hypercubes

      ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE
    16. Chang, JS; Chiueh, TD
      Image vector quantization using classified binary-tree-structured self-organizing feature maps

      IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS
    17. Mitsubayashi, A; Takasu, R
      Minimum congestion embedding of complete binary trees into tori

      IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
    18. Diestel, R
      An accessibility theorem for infinite graph minors

      JOURNAL OF GRAPH THEORY
    19. Ravindran, S; Gibbons, AM; Paterson, MS
      Dense edge-disjoint embedding of complete binary trees in interconnection networks

      THEORETICAL COMPUTER SCIENCE
    20. Lin, MB
      On the design of fast large fan-in CMOS multiplexers

      IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS
    21. Akl, SG; Olariu, S; Stojmenovic, I
      A new BFS parent array encoding of t-ary trees

      COMPUTERS AND ARTIFICIAL INTELLIGENCE
    22. Iyer, NS; Kandel, A; Schneider, M
      Feature-based fuzzy classification for interpretation of mammograms

      FUZZY SETS AND SYSTEMS
    23. Cole, R; Mishra, B; Schmidt, J; Siegel, A
      On the dynamic finger conjecture for splay trees. Part I: Splay sorting log n-block sequences

      SIAM JOURNAL ON COMPUTING
    24. Cole, R
      On the dynamic finger conjecture for splay trees. Part II: The proof

      SIAM JOURNAL ON COMPUTING
    25. Fang, WC; Hsu, CC
      On the fault-tolerant embedding of complete binary trees in the pancake graph interconnection network

      INFORMATION SCIENCES
    26. Coppersmith, D; Hong, SJ; Hosking, JRM
      Partitioning nominal attributes in decision trees

      DATA MINING AND KNOWLEDGE DISCOVERY
    27. Hurtado, F; Noy, M
      Graph of triangulations of a convex polygon and tree of triangulations

      COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS
    28. Wei, SG; Shimizu, K
      Compact residue arithmetic multiplier based on the radix-4 signed-digit multiple-valued arithmetic circuits

      IEICE TRANSACTIONS ON ELECTRONICS
    29. Abrevaya, J
      Computation of the maximum rank correlation estimator

      ECONOMICS LETTERS
    30. Chen, CY; Liu, TC
      A fast modular multiplication method based on the Lempel-Ziv binary tree

      COMPUTER COMMUNICATIONS
    31. DEVROYE L
      UNIVERSAL LIMIT LAWS FOR DEPTHS IN RANDOM TREES

      SIAM journal on computing (Print)
    32. Tseng, YC; Chen, YS; Juang, TY; Chang, CJ
      Congestion-free, dilation-2 embedding of complete binary trees into star graphs

      NETWORKS
    33. Ahrabian, H; Nowzari-Dalini, A
      On the generation of binary trees in A-order

      INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS
    34. Makinen, E
      Generating random binary trees - A survey

      INFORMATION SCIENCES
    35. Kruszewski, P
      A note on the Horton-Strahler number for random binary search trees

      INFORMATION PROCESSING LETTERS
    36. Sebo, A; Waksman, Z
      Optimal binary trees with order constraints

      DISCRETE APPLIED MATHEMATICS
    37. Huang, CH; Hsiao, JY; Lee, RCT
      Embedding incomplete binary trees into incomplete hypercubes

      IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES
    38. DELGADOFRIAS JG; NYATHI J; SUMMERVILLE DH
      A PROGRAMMABLE DYNAMIC INTERCONNECTION NETWORK ROUTER WITH HIDDEN REFRESH

      IEEE transactions on circuits and systems. 1, Fundamental theory andapplications
    39. MASUYAMA H; YODA T
      SUCCESSFUL PERCENTAGES OF EMBEDDING SUBSYSTEMS INTO HYPERCUBES

      IEICE transactions on information and systems
    40. CHANG ML; FENG WS
      A RECURSIVE ALGORITHM FOR ESTIMATING THE INTERNAL CHARGE SHARING EFFECT IN RC TREE CIRCUITS

      IEICE transactions on fundamentals of electronics, communications and computer science
    41. RAKOCEVIC MM
      THE GENETIC-CODE AS A GOLDEN MEAN DETERMINED SYSTEM

      Biosystems
    42. GOLDBERG SR; UPADHYAYA SJ
      IMPLEMENTING DEGRADABLE PROCESSING ARRAYS

      IEEE MICRO
    43. CHEN YW; CHUNG KL
      ON FAULT-TOLERANT EMBEDDING COMPLETE BINARY-TREES INTO HYPERCUBES

      Computer systems science and engineering
    44. MASCIO LN; YUEN BK; KEGELMEYER WP; MATSUMOTO K; BRINER J; WYROBEK AJ
      ADVANCES IN THE AUTOMATED DETECTION OF METAPHASE CHROMOSOMES LABELED WITH FLUORESCENCE DYES

      Cytometry
    45. JIA XP; RICHARDS JA
      PROGRESSIVE 2-CLASS DECISION CLASSIFIER FOR OPTIMIZATION OF CLASS DISCRIMINATIONS

      Remote sensing of environment
    46. Zoghbi, A; Stojmenovic, I
      Fast algorithms for generating integer partitions

      INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS
    47. VAJNOVSZKI V
      ON THE LOOPLESS GENERATION OF BINARY-TREE SEQUENCES

      Information processing letters
    48. Cameron, H
      Fringe thickness and maximum path length of binary trees

      DISCRETE APPLIED MATHEMATICS
    49. FLAJOLET P; GOURDON X; MARTINEZ C
      PATTERNS IN RANDOM BINARY SEARCH-TREES

      Random structures & algorithms
    50. DUTT S; HAYES JP
      A LOCAL-SPARING DESIGN METHODOLOGY FOR FAULT-TOLERANT MULTIPROCESSORS

      Computers & mathematics with applications
    51. HAMEL AM; STEEL MA
      THE LENGTH OF A LEAF COLORATION ON A RANDOM BINARY-TREE

      SIAM journal on discrete mathematics
    52. NAGARAJ SV
      OPTIMAL BINARY SEARCH-TREES

      Theoretical computer science
    53. HSU CC
      MAPPING 2 COMPLETE BINARY-TREES INTO THE STAR GRAPH WITH QUICK FAULT RECOVERY

      New generation computing
    54. VO KP
      CDT - A CONTAINER DATA TYPE LIBRARY

      Software, practice & experience
    55. SHISHIBORI M; AOE J
      AN ORDER SEARCHING ALGORITHM OF EXTENSIBLE HASHING

      International journal of computer mathematics
    56. KIM SK
      LOGARITHMIC WIDTH, LINEAR AREA UPWARD DRAWING OF AVL TREES

      Information processing letters
    57. LEE SK; CHOI HA
      EMBEDDING OF COMPLETE BINARY-TREES INTO MESHES WITH ROW-COLUMN ROUTING

      IEEE transactions on parallel and distributed systems
    58. YANG PJ; RAGHAVENDRA CS
      EMBEDDING AND RECONFIGURATION OF BINARY-TREES IN FAULTY HYPERCUBES

      IEEE transactions on parallel and distributed systems
    59. STOJMENOVIC I
      CONSTANT-TIME BSR SOLUTIONS TO PARENTHESIS MATCHING, TREE DECODING, AND TREE RECONSTRUCTION FROM ITS TRAVERSALS

      IEEE transactions on parallel and distributed systems
    60. EFE K; FERNANDEZ A
      MESH-CONNECTED TREES - A BRIDGE BETWEEN GRIDS AND MESHES OF TREES

      IEEE transactions on parallel and distributed systems
    61. WEI SG; SHIMIZU K
      MODULE 2(P-1) ARITHMETIC HARDWARE ALGORITHM USING SIGNED-DIGIT NUMBERREPRESENTATION

      IEICE transactions on information and systems
    62. TSUCHIYA H; ITOH S; HASHIMOTO T
      AN ALGORITHM FOR DESIGNING A PATTERN CLASSIFIER BY USING MDL CRITERION

      IEICE transactions on fundamentals of electronics, communications and computer science
    63. GIESEN RJB; HUYNEN AL; AARNINK RG; DELAROSETTE JJMCH; DEBRUYNE FMJ; WIJKSTRA H
      CONSTRUCTION AND APPLICATION OF HIERARCHICAL DECISION TREE FOR CLASSIFICATION OF ULTRASONOGRAPHIC PROSTATE IMAGES

      Medical & biological engineering & computing
    64. FENWICK PM
      A NEW DATA STRUCTURE FOR CUMULATIVE PROBABILITY TABLES - AN IMPROVED FREQUENCY-TO-SYMBOL ALGORITHM

      Software, practice & experience
    65. CHAI BB; HUANG T; ZHUANG XH; ZHAO YX; SKLANSKY J
      PIECEWISE-LINEAR CLASSIFIERS USING BINARY-TREE STRUCTURE AND GENETIC ALGORITHM

      Pattern recognition
    66. BAGHERZADEH N; DOWD M; NASSIF N
      EMBEDDING AN ARBITRARY BINARY-TREE INTO THE STAR GRAPH

      I.E.E.E. transactions on computers
    67. CHANG JM; GEHRINGER EF
      A HIGH-PERFORMANCE MEMORY ALLOCATOR FOR OBJECT-ORIENTED SYSTEMS

      I.E.E.E. transactions on computers
    68. DASSHARMA D; PRADHAN DK
      PROCESSOR ALLOCATION IN HYPERCUBE MULTICOMPUTERS - FAST AND EFFICIENTSTRATEGIES FOR CUBIC AND NONCUBIC ALLOCATION

      IEEE transactions on parallel and distributed systems
    69. BAO HJ; PENG QS
      A FAST RAY-TRACING ALGORITHM-BASED ON ADAPTIVE SPACE SUBDIVISION

      Science in China. Series A, Mathematics, Physics, Astronomy & Technological Sciences
    70. SAHA D
      IMPROVED TOPOLOGY FOR ACHIEVING RELIABILITY IN HIGH-SPEED TREE LANS

      Computer systems science and engineering
    71. LAPOINTE FJ; LEGENDRE P
      COMPARISON TESTS FOR DENDROGRAMS - A COMPARATIVE-EVALUATION

      Journal of classification
    72. SEKHARAN CN; GOEL V; SRIDHAR R
      LOAD BALANCING METHODS FOR RAY-TRACING AND BINARY-TREE COMPUTING USING PVM

      Parallel computing
    73. BASU SK; GUPTA JD; GUPTA RD
      ON SYNTHESIZING CUBE AND TREE FOR PARALLEL-PROCESSING

      Microprocessing and microprogramming
    74. PRADHAN J; SASTRY CV
      ON OPTIMAL WEIGHTED BINARY-TREES

      International journal of high speed computing
    75. GUPTA AK; WANG H
      ON IMPROVING THE PERFORMANCE OF TREE MACHINES

      International journal of high speed computing
    76. DEVROYE L; ROBSON JM
      ON THE GENERATION OF RANDOM BINARY SEARCH-TREES

      SIAM journal on computing
    77. DEVROYE L; REED B
      ON THE VARIANCE OF THE HEIGHT OF RANDOM BINARY SEARCH-TREES

      SIAM journal on computing
    78. ROCCETTI M
      RELIABILITY-ANALYSIS OF TREE-BASED NETWORKS AND ITS APPLICATION TO FAULT-TOLERANT VLSI SYSTEMS

      Networks
    79. CULL P; LARSON SM
      ON GENERALIZED TWISTED CUBES

      Information processing letters
    80. CHEN CC; CHEN RJ
      COMPACT EMBEDDING OF BINARY-TREES INTO HYPERCUBES

      Information processing letters
    81. KULASINGHE P; BETTAYEB S
      EMBEDDING BINARY-TREES INTO CROSSED CUBES

      I.E.E.E. transactions on computers
    82. GALLIVAN K; HANSEN PC; OSTROMSKY T; ZLATEV Z
      A LOCALLY OPTIMIZED REORDERING ALGORITHM AND ITS APPLICATION TO A PARALLEL SPARSE LINEAR-SYSTEM SOLVER

      Computing
    83. YANG OWW
      2-CENTER TREE TOPOLOGIES FOR METROPOLITAN-AREA NETWORKS

      IEE proceedings. Communications
    84. HSU CC; LIU YW
      QUICK RECOVERY OF 2 EMBEDDED COMPLETE BINARY-TREES IN A HYPERCUBE

      IEE proceedings. Computers and digital techniques
    85. DONSKOY VI
      DUAL EXPERT-SYSTEMS

      Journal of computer & systems sciences international
    86. BERTOSSI AA; BONUCCELLI MA; ROCCETTI M
      RECONFIGURABLE TREE ARCHITECTURES FOR GRACEFULLY DEGRADABLE VLSI SYSTEMS

      Journal of parallel and distributed computing
    87. PERNUS F; LEONARDIS A; KOVACIC S
      2-DIMENSIONAL OBJECT RECOGNITION USING MULTIRESOLUTION NON-INFORMATION-PRESERVING SHAPE-FEATURES

      Pattern recognition letters
    88. LARMORE LL; PRZYTYCKA TM
      A FAST ALGORITHM FOR OPTIMUM HEIGHT-LIMITED ALPHABETIC BINARY-TREES

      SIAM journal on computing
    89. SUNDAR R; TARJAN RE
      UNIQUE BINARY-SEARCH-TREE REPRESENTATIONS AND EQUALITY TESTING OF SETS AND SEQUENCES

      SIAM journal on computing
    90. FENWICK PM
      A NEW DATA STRUCTURE FOR CUMULATIVE FREQUENCY TABLES

      Software, practice & experience
    91. HOSSAIN M; GHANTA S
      SIMULATION OF BINARY-TREE AND PYRAMID ARCHITECTURES ON OPTICAL RECONFIGURABLE ARRAY PROCESSORS

      Optics and Laser Technology
    92. KETOJA JA; KURKIJARVI J
      BINARY-TREE APPROACH TO SCALING IN UNIMODAL MAPS

      Journal of statistical physics
    93. BAPIRAJU V; RAO VV
      ENUMERATION OF BINARY-TREES

      Information processing letters
    94. CHEN YY; UPADHYAYA SJ
      MODELING THE RELIABILITY OF A CLASS OF FAULT-TOLERANT VLSI WSI SYSTEMS BASED ON MULTIPLE-LEVEL REDUNDANCY/

      I.E.E.E. transactions on computers
    95. CHAN MY; LEE SJ
      FAULT-TOLERANT EMBEDDING OF COMPLETE BINARY-TREES IN HYPERCUBES

      IEEE transactions on parallel and distributed systems
    96. NAKAMURA Y; ABE S; OHSAWA Y; SAKAUCHI M
      A BALANCED HIERARCHICAL DATA STRUCTURE FOR MULTIDIMENSIONAL DATA WITHHIGHLY EFFICIENT DYNAMIC CHARACTERISTICS

      IEEE transactions on knowledge and data engineering
    97. ELAMAWY A; RAJA R
      SPLIT SEQUENCE GENERATION ALGORITHMS FOR EFFICIENT IDENTIFICATION OF OPERATIONAL SUBCUBES IN FAULTY HYPERCUBES

      Parallel computing
    98. MITTAL R; JAIN BN; PATNEY RK
      LINK AUGMENTED BINARY (LAB)-TREE ARCHITECTURE

      IEE proceedings. Part E. Computers and digital techniques
    99. ERCIL A; DENIZHAN Y; OKCULAR A; ZORA G
      CLASSIFICATION TREES PROVE USEFUL IN NONDESTRUCTIVE TESTING OF SPOT WELD QUALITY

      Welding journal
    100. HE DK
      THE NEW DESIGN OF THE THREADED BINARY-TREES

      International journal of computer mathematics


ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 22/01/21 alle ore 03:52:24