|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 904 occurrences of 523 keywords
|
|
|
Results
Found 113 publication records. Showing 113 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
16 | Karl R. P. H. Leung, Wai Wong |
Deriving test cases using class vectors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APSEC ![In: 7th Asia-Pacific Software Engineering Conference (APSEC 2000), 5-8 December 2000, Singapore, pp. 146-153, 2000, IEEE Computer Society, 0-7695-0915-0. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
software test case derivation, class vectors, human decision-making, vector partitions, formal specification, formal specifications, program testing, pattern classification, vectors, trees (mathematics), tree structure, expressive power, classification trees, Cartesian product |
16 | David R. Karger, Maria Minkoff |
Building Steiner Trees with Incomplete Global Knowledge. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA, pp. 613-623, 2000, IEEE Computer Society, 0-7695-0850-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
combinational switching, incomplete global knowledge, network usage minimization, data item distribution, data-requesting clients, connection probability, fixed data path specification, concave cost functions, open facilities, minimum demand, bicriterion approximation, assignment cost, trees (mathematics), Steiner trees, client-server systems, facility location, minimisation, approximation theory, uncertainty handling, facility location problem, economies of scale, vertex, network synthesis, network design problems |
16 | Sunil Arya, Theocharis Malamatos, David M. Mount |
Nearly Optimal Expected-Case Planar Point Location. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA, pp. 208-218, 2000, IEEE Computer Society, 0-7695-0850-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
nearly optimal expected-case planar point location, expected search time, planar polygonal subdivision, search structure, optimal binary search tree, polygonal subdivision, polygonal cells, convex cells, data structure, computational geometry, probability, trees (mathematics), search problems, subdivision, planar point location |
16 | Monika Maidl |
The Common Fragment of CTL and LTL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA, pp. 643-652, 2000, IEEE Computer Society, 0-7695-0850-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
action-based computation tree logic, linear time logic, common fragment, ACTL formulas, PSPACE-complete problem, path quantifiers, 1-weak Buchi automaton, automaton size, formula size, computational complexity, temporal logic, trees (mathematics), decidability, finite automata, expressive power, negation, CTL, LTL, inductive definition |
16 | Adam Meyerson, Kamesh Munagala, Serge A. Plotkin |
Cost-Distance: Two Metric Network Design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA, pp. 624-630, 2000, IEEE Computer Society, 0-7695-0850-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
cost-distance problem, 2-metric network design, edge cost sum optimization, source-sink distance sum optimization, randomized approximation scheme, source number, logarithmic approximation, single-sink buy-at-bulk problem, variable pipe types, single-source multicast trees, delay properties, multi-level facility location, computational complexity, trees (mathematics), cost, Steiner tree, facility location, telecommunication network routing, edges, approximation theory, randomised algorithms, network synthesis |
16 | Valentin Muresan, Xiaojun Wang 0001, Valentina Muresan, Mircea Vladutiu |
Distribution-graph based approach and extended tree growing technique in power-constrained block-test scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Asian Test Symposium ![In: 9th Asian Test Symposium (ATS 2000), 4-6 December 2000, Taipei, Taiwan, pp. 465-470, 2000, IEEE Computer Society, 0-7695-0887-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
distribution-graph based approach, extended tree growing technique, power-constrained block-test scheduling, unequal-length block-test scheduling, power dissipation constraints, test concurrency, assigned power dissipation limits, balanced test power dissipation, least mean square error function, global priority function, system-level test scheduling algorithm, scheduling, VLSI, fault diagnosis, logic testing, high level synthesis, integrated circuit testing, automatic test pattern generation, trees (mathematics), least mean squares methods |
16 | Marc Mosko, J. J. Garcia-Luna-Aceves |
An Analysis of Packet Loss Correlation in FEC-Enhanced Multicast Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICNP ![In: Eighth Annual International Conference on Network Protocols, ICNP 2000, 14-17 November, 2000, Osaka, Japan, pp. 151-164, 2000, IEEE Computer Society, 0-7695-0921-5. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
packet loss correlation, FEC-enhanced multicast trees, group loss probabilities, forward error correction codes, state equations, recursive formulae, FEC group, shared loss tree, leaf nodes, transmission group, missing packets, nonuniform link loss, nonFEC trees, Internet, probability, error correction codes, packet switching, decoding, decoding, trees (mathematics), forward error correction, multicast communication, erasure codes, correlation methods, probability mass function, cumulative distribution function |
16 | Yuan Gao, Ye Ge, Jennifer C. Hou |
RMCM: Reliable Multicasts for Core-based Multicast Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICNP ![In: Eighth Annual International Conference on Network Protocols, ICNP 2000, 14-17 November, 2000, Osaka, Japan, pp. 83-94, 2000, IEEE Computer Society, 0-7695-0921-5. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
core-based multicast trees, RMCM, multicast applications, on-tree router, core-based tree, retransmission request, optimal recovery, turning point approach, IP options, group membership changes, repliers, delayed ACK approach, repair-based reliable multicast, NAK implosion control, recovery latency, recovery isolation, FreeBSD 2.2.8, Internet, Internet, transport protocols, packet switching, network topology, digital simulation, trees (mathematics), telecommunication network routing, multicast communication, reliable multicasts, event-driven simulation, topology changes, local recovery, data packets, hosts |
16 | Yulu Ma, Shiduan Cheng |
Multi-Cores Uni-Directional Shared Trees Multicast Routing Protocol. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LCN ![In: Proceedings 27th Conference on Local Computer Networks, Tampa, Florida, USA, 8-10 November, 2000, pp. 495-496, 2000, IEEE Computer Society, 0-7695-0912-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
multi-cores uni-directional shared trees, CBT, PIM-SM, intradomain multicast routing protocols, efficient member management mechanism, authentication, protocols, admission control, trees (mathematics), telecommunication network routing, multicast communication, multicast group, packet transmission |
16 | T. Y. Chen, Y. Y. Cheung |
Structural Properties of Post-Dominator Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Australian Software Engineering Conference ![In: 1997 Australian Software Engineering Conference (ASWEC '97), 28 September - 2 October 1997, Sydney, Australia, pp. 158-165, 1997, IEEE Computer Society, 0-8186-8081-4. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
post dominator trees, program slicing, trees (mathematics), test suite reduction, structural properties, construction algorithm, code optimisation |
16 | Ron Shamir, Dekel Tsur |
Faster subtree isomorphism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISTCS ![In: Fifth Israel Symposium on Theory of Computing and Systems, ISTCS 1997, Ramat-Gan, Israel, June 17-19, 1997, Proceedings, pp. 126-131, 1997, IEEE Computer Society, 0-8186-8037-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
subtree isomorphism problem, graph theory, randomized algorithm, trees, trees (mathematics), computation time, vertices, decision problem |
16 | Sung Kwon Kim |
An efficient parallel algorithm for the planar mincut linear arrangement problem for trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 1997 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '97), 18-20 December 1997, Taipei, Taiwan, pp. 240-246, 1997, IEEE Computer Society, 0-8186-8259-0. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
planar mincut, parallel algorithm, NP-complete, trees (mathematics), EREW PRAM, polynomial-time solvable |
16 | Hugo Bravo-Azlán, Alfredo Candia-Véjar |
A Metaheuristic Solution to a Constrained Steiner Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCCC ![In: Proceedings of 17th International Conference of the Chilean Computer Science Society (SCCC '97), November 12-14, 1997, Valpariso, Chile, pp. 16-20, 1997, IEEE Computer Society, 0-8186-8052-0. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
metaheuristic solution, constrained Steiner tree problem, arc resource requirements, trees (mathematics), directed acyclic graphs, budget, simulated annealing algorithm |
16 | Joaquim Gabarró, Xavier Messeguer, Daniel Riu |
Concurrent Rebalancing on HyperRed-Black Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCCC ![In: Proceedings of 17th International Conference of the Chilean Computer Science Society (SCCC '97), November 12-14, 1997, Valpariso, Chile, pp. 93-104, 1997, IEEE Computer Society, 0-8186-8052-0. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
concurrent rebalancing, HyperRed-Black trees, consecutive red nodes, Chromatic trees, red nodes, concurrent deletions algorithm, concurrent insertions, direct updating, red cluster, trees (mathematics), deletions |
16 | G. Seaman |
A Latency-Hiding MIMD Wavelet Transform. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PDP ![In: 4th Euromicro Workshop on Parallel and Distributed Processing (PDP '96), January 24-26, 1996, Portugal, pp. 22-26, 1996, IEEE Computer Society, 0-8186-7376-1. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
latency-hiding MIMD wavelet transform, systolic processors, MIMD systems, tree-based structure, data-parallel SIMD, synchronous fine-grained communication, data driven algorithm, real-time systems, real time systems, parallel algorithms, parallel algorithm, scalable, parallel processing, wavelet transforms, message passing, message-passing, SIMD, discrete wavelet transform, trees (mathematics), mathematics computing, communication latency |
16 | Aniello Iazzetta, C. Sanges, Umberto Scafuri |
Tree-Based Communication Model for WK-Recursive Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PDP ![In: 4th Euromicro Workshop on Parallel and Distributed Processing (PDP '96), January 24-26, 1996, Portugal, pp. 204-210, 1996, IEEE Computer Society, 0-8186-7376-1. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
tree-based communication model, WK interconnection network topologies, fully scalable structure, collective communication mechanisms design, multicasting, broadcasting, multiprocessor interconnection networks, network topology, trees (mathematics), massively parallel systems, WK-recursive networks |
16 | Naveen Garg 0001 |
A 3-Approximation for the Minimum Tree Spanning k Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996, pp. 302-309, 1996, IEEE Computer Society, 0-8186-7594-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
minimum tree, 3-approximation, k-vertices, minimum tour, spanning k vertices, graph, trees (mathematics) |
16 | Paul W. Fieguth, William W. Irving, Alan S. Willsky |
Multiresolution model development for overlapping trees via canonical correlation analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIP ![In: Proceedings 1995 International Conference on Image Processing, Washington, DC, USA, October 23-26, 1995, pp. 45-48, 1995, IEEE Computer Society, 0-8186-7310-9. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
overlapping trees, multiscale stochastic models, Gaussian random processes, scale recursive dynamics, fast statistically optimal algorithm, tree nodes, estimation algorithm, optimal estimation results, error covariance information, statistics, image representation, trees (mathematics), error analysis, image resolution, Gaussian processes, random processes, estimation theory, multiresolution model, correlation methods, canonical correlation analysis, covariance analysis, multiscale representations, image pixel, image domain |
16 | Takuro Kida |
The extended optimum interpolatory approximation of multi-dimensional signals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIP ![In: Proceedings 1995 International Conference on Image Processing, Washington, DC, USA, October 23-26, 1995, pp. 233-236, 1995, IEEE Computer Society, 0-8186-7310-9. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
signal sampling, delay circuits, extended optimum interpolatory approximation, multidimensional signals, optimum space limited interpolation functions, space variable domain, decimated sample values, equivalent transformation, cosine modulated filter bank, linear phase filter bank, iterative linear approximation, reciprocal relation, interpolation, iterative methods, trees (mathematics), quantization, filtering theory, tree structure, band-pass filters, quantisation (signal) |
16 | Jia-Bao Cheng, Hsueh-Ming Hang |
Adaptive piecewise linear bits estimation model for MPEG based video coding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIP ![In: Proceedings 1995 International Conference on Image Processing, Washington, DC, USA, October 23-26, 1995, pp. 551-554, 1995, IEEE Computer Society, 0-8186-7310-9. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
piecewise-linear techniques, MPEG based video coding, adaptive piecewise linear bits estimation model, tree-structured piecewise linear filter, macroblock bits, activity/stepsize, modified LMS algorithm, computer simulation results, table-look-up bits model, complexity, parameter estimation, video coding, cluster analysis, trees (mathematics), adaptive filters, filtering theory, node, telecommunication standards, parameters, code standards, image contents, adaptive estimation, least mean squares methods |
16 | Leszek Borzemski |
Load balancing in parallel and distributed processing of tree-based multiple-task jobs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PDP ![In: 3rd Euromicro Workshop on Parallel and Distributed Processing (PDP '95), January 25-27, 1995, San Remo, Italy, pp. 98-105, 1995, IEEE Computer Society, 0-8186-7031-2. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
batch processing (computers), tree-based multiple-task jobs, tree based multiple task jobs, incoming workload, problem-specific static algorithms, prescheduling load balancing algorithms, dynamic load balancing algorithms, parallel processing, parallel processing, resource allocation, distributed processing, trees (mathematics), task allocation, batch processing |
16 | Jon M. Kleinberg, Éva Tardos |
Disjoint Paths in Densely Embedded Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 52-61, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
densely embedded graphs, communication paths, nearly-Eulerian graphs, locally planar interconnection networks, constant-factor approximation algorithm, maximum disjoint paths, on-line setting, routing, computational geometry, heuristics, multiprocessor interconnection networks, trees (mathematics), high-speed networks, operations research, disjoint paths, two-dimensional mesh |
16 | Milena Mihail, Christos Kaklamanis, Satish Rao |
Efficient Access to Optical Bandwidth - Wavelength Routing on Directed Fiber Trees, Rings, and Trees of Rings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 548-557, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
efficient access, optical bandwidth wavelength routing, directed fiber trees, directed graph models, trees of rings, fiber links, physical directedness, optical amplifiers, polynomial time routing algorithm, optical wavelengths, fixed W wavelength technology, optical routing requirements, coloring paradigms, multicolored alternating cycles, averaging analysis, directed graphs, trees (mathematics), wavelength division multiplexing, wavelength division multiplexing, graph colouring, optical communication, approximation factor, WDM optical networks, ring topologies, tree topologies |
16 | S. Rao Kosaraju |
Faster Algorithms for the Construction of Parameterized Suffix Trees (Preliminary Version). ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 631-637, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
parameterized suffix trees, suffix tree algorithm, code duplication problem, computational complexity, pattern matching, trees (mathematics), string matching, suffix tree, algorithm theory |
16 | Paolo Ferragina |
An EREW PRAM fully-dynamic algorithm for MST. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPPS ![In: Proceedings of IPPS '95, The 9th International Parallel Processing Symposium, April 25-28, 1995, Santa Barbara, California, USA, pp. 93-100, 1995, IEEE Computer Society, 0-8186-7074-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
EREW PRAM fully-dynamic algorithm, undirected weighted graph, single edge insertions, single edge deletions, sparsification data structure, parallel algorithms, parallel algorithm, computational complexity, time, trees (mathematics), minimum spanning tree, tree data structures, nodes, work |
16 | Keith D. Gremban, Gary L. Miller, Marco Zagha |
Performance evaluation of a new parallel preconditioner. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPPS ![In: Proceedings of IPPS '95, The 9th International Parallel Processing Symposium, April 25-28, 1995, Santa Barbara, California, USA, pp. 65-69, 1995, IEEE Computer Society, 0-8186-7074-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
parallel preconditioner, support tree preconditioners, diagonal scaling preconditioner, incomplete Cholesky preconditioner, overall storage, total execution time, performance evaluation, parallel processing, iterative method, trees (mathematics), software performance evaluation, linear systems, sparse matrices, sparse matrices, conjugate gradient methods, graph connectivity, preconditioned conjugate gradient method |
16 | Robert J. Carragher, Masahiro Fujita, Chung-Kuan Cheng |
Simple tree-construction heuristics for the fanout problem . ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCD ![In: 1995 International Conference on Computer Design (ICCD '95), VLSI in Computers and Processors, October 2-4, 1995, Austin, TX, USA, Proceedings, pp. 671-679, 1995, IEEE Computer Society, 0-8186-7165-3. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
tree-construction heuristics, fanout problem, fanout delay, buffer fanout trees, technology mapped network, gate-transformation, LT-tree construction technique, delays, combinational circuits, trees (mathematics), critical paths, logical functions |
16 | Atsushi Hori, Munenori Maeda, Yutaka Ishikawa, Takashi Tomokiyo, Hiroki Konaka |
A scalable time-sharing scheduling for partitionable distributed memory parallel machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HICSS (2) ![In: 28th Annual Hawaii International Conference on System Sciences (HICSS-28), January 3-6, 1995, Kihei, Maui, Hawaii, USA, pp. 173-182, 1995, IEEE Computer Society, 0-8186-6945-4. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
time-sharing systems, scalable time-sharing scheduling, partitionable distributed memory parallel machines, process scheduling queue system, distributed queue tree, dynamically partitionable parallel machines, dynamically nested partitioning, time-sharing scheduling, process scheduling queues, round-robin scheduling algorithm, task allocation policies, high-load situations, parallel machines, reconfigurable architectures, trees (mathematics), distributed memory systems, processor scheduling, simulation results, interactive environment, time-sharing, nested, batch scheduling, processor utilization |
16 | Fengrong Ren, Hiroshi Tanaka, Noria Fukuda, Takashi Gojobori |
Molecular evolutionary phylogenetic trees based on minimum description length principle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HICSS (5) ![In: 28th Annual Hawaii International Conference on System Sciences (HICSS-28), January 3-6, 1995, Kihei, Maui, Hawaii, USA, pp. 165-173, 1995, IEEE Computer Society, 0-8186-6945-4. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
molecular evolutionary phylogenetic trees, minimum complexity phylogenetic tree, branch lengths, logarithmic likelihood, mitochondrial DNA sequences, complexity, trees (mathematics), inference mechanisms, DNA, genetics, biology computing, inductive inference, minimum description length principle, tree topology |
16 | Paraskevi Fragopoulou, Selim G. Akl |
Fault tolerant communication algorithms on the star network using disjoint paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HICSS (2) ![In: 28th Annual Hawaii International Conference on System Sciences (HICSS-28), January 3-6, 1995, Kihei, Maui, Hawaii, USA, pp. 4-13, 1995, IEEE Computer Society, 0-8186-6945-4. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
fault-tolerant communication algorithms, node pairs, directed edge-disjoint spanning trees, single-node broadcasting, multinode broadcasting, single-node scattering problem, all-port communication assumption, faulty edges, multinode scattering problem, interconnection networks, fault tolerant computing, broadcasting, graph, multiprocessor interconnection networks, trees (mathematics), disjoint paths, star network, message transmission, faulty nodes |
16 | Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau |
Embeddings of complete binary trees into star graphs with congestion 1. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HICSS (2) ![In: 28th Annual Hawaii International Conference on System Sciences (HICSS-28), January 3-6, 1995, Kihei, Maui, Hawaii, USA, pp. 546-554, 1995, IEEE Computer Society, 0-8186-6945-4. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
complete binary tree embeddings, vertex congestion, graph height, binary tree architecture, parallel architectures, multiprocessor interconnection networks, trees (mathematics), dilation, star graphs, algorithm simulation |
16 | Joseph L. Ganley, James P. Cohoon |
Thumbnail rectilinear Steiner trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Great Lakes Symposium on VLSI ![In: 5th Great Lakes Symposium on VLSI (GLS-VLSI '95), March 16-18, 1995, The State University of New York at Buffalo, USA, pp. 46-49, 1995, IEEE Computer Society, 0-8186-7035-5. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
full-set decomposition algorithm, minimum-length set, thumbnail rectilinear Steiner tree problem, VLSI placement algorithms, geometric partitioning, field programmable gate arrays, field-programmable gate arrays, VLSI, dynamic programming, network topology, logic CAD, trees (mathematics), network routing, circuit layout CAD, global routing, line segments |
16 | Jin-Tai Yan, Pei-Yung Hsiao |
A new fuzzy-clustering-based approach for two-way circuit partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLSI Design ![In: 8th International Conference on VLSI Design (VLSI Design 1995), 4-7 January 1995, New Delhi, India, pp. 359-364, 1995, IEEE Computer Society, 0-8186-6905-5. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
fuzzy-clustering-based approach, two-way circuit partitioning, circuit netlist, undirected edge-weighted graph, tree net model, clustering distance, area information, area-balanced constraints, circuit benchmarks, VLSI, simulated annealing, network topology, trees (mathematics), fuzzy set theory, logic partitioning, fuzzy c-means clustering, fuzzy memberships |
16 | Atsuhiro Takasu, Shin'ichi Satoh 0001, Eishi Katsura |
A rule learning method for academic document image processing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDAR ![In: Third International Conference on Document Analysis and Recognition, ICDAR 1995, August 14 - 15, 1995, Montreal, Canada. Volume I, pp. 239-242, 1995, IEEE Computer Society, 0-8186-7128-9. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
educational administrative data processing, syntactic rule learning method, academic document image processing, CyberMagazine, database tuples, block segmentation, rough classification, two dimensional plane, ordinal context free grammar, symbol concatenation, non terminal symbols, decomposed trees, learning (artificial intelligence), image segmentation, image classification, trees (mathematics), document image processing, computational linguistics, visual databases, visual database, context-free grammars, syntactic analysis, parse trees, digital library system |
16 | Seong-Whan Lee, Jong Soo Kim |
Multi-lingual, multi-font and multi-size large-set character recognition using self-organizing neural network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDAR ![In: Third International Conference on Document Analysis and Recognition, ICDAR 1995, August 14 - 15, 1995, Montreal, Canada. Volume I, pp. 28-33, 1995, IEEE Computer Society, 0-8186-7128-9. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
multilingual multi font large set character recognition, nonlinear shape normalization, dot density, hierarchical features, coarse classification, hierarchical tree classifier, SOFM/LVQ based classifier, adaptive SOFM coarse classifier, LVQ4 language classifiers, fine classification, recognition experiments, 486 DX-2 66 MHz PC, daptive SOFM coarse classifier, LVQ4 fine classifiers, feature extraction, character recognition, natural languages, image classification, trees (mathematics), execution time, linguistics, recognition rate, self-organising feature maps, self organizing neural network |
16 | Shyan-Ming Yuan, Her-Kun Chang |
Comments on "Availability of k-Coterie". ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 43(12), pp. 1457, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
k-coterie, k-majority coterie, distributed k-mutual exclusion problem, trees (mathematics) |
16 | Si-Qing Zheng |
Compressed Tree Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 43(2), pp. 222-225, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
modified tree architecture, compressed tree machine, cost/performance trade-off, multiprocessor parallel computer, parallel processing, parallel architectures, multiprocessor interconnection networks, trees (mathematics), tree structure, VLSI layout, parallel computer architecture |
16 | Joydeep Ghosh, Sajal K. Das 0001, Ajita John |
Concurrent Processing of Linearly Ordered Data Structures on Hypercube Multicomputers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 5(9), pp. 898-911, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
concurrentprocessing, linearly ordered data structures, concurrentmanipulation, augmented binomial search tree, pruned binomial tree, arbitrary processor node, consecutive nodes, nonoverlappingprocessor lists, intermediate-levelimage processing algorithms, dictionary operations, low-level image processingalgorithms, Gray code embedding, distributed memorymulticomputers, parallel algorithms, parallel programming, broadcast, hypercube networks, trees (mathematics), distributed memory systems, search problems, merge, tree data structures, search trees, k-ary n-cubes, concurrent data structure, hypercube multicomputers, local information, fanout, hypercube systems |
16 | Adair Dingle, Ivan Hal Sudborough |
Efficient Mappings of Pyramid Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 5(10), pp. 1009-1017, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
pyramid network mapping, large networksimulation, small networks, networkarchitectures, unbounded growth, single host processor, graphembeddings, parallel networks, load balancing, data structures, data structures, interconnection networks, graph theory, resource allocation, multiprocessors, optimisation, trees (mathematics), simulation modelling, communication cost, tree networks, multiprocessor interconnectionnetworks |
16 | Bharadwaj Veeravalli, Debasish Ghose, V. Mani |
Optimal Sequencing and Arrangement in Distributed Single-Level Tree Networks with Communication Delays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 5(9), pp. 968-976, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
optimalsequencing, distributed single-level tree networks, optimalprocessing time, single-level treearchitecture, optimal load distribution, load sequencing, processor-link arrangement, general case, computationalresults, root processor, front-end processor, optimal arrangement, resource allocation, distributed processing, distributed processing, optimisation, trees (mathematics), communication delays, distributed computing system, communication links, closed-form expressions |
16 | George Karypis, Vipin Kumar 0001 |
Unstructured Tree Search on SIMD Parallel Computers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 5(10), pp. 1057-1072, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
unstructured tree search, SIMD parallelcomputers, unstructured tree computations, large-scale SIMD machines, triggering mechanism, search spaceredistribution, load-balancing methods, load-balancing schemes, 15-puzzle problem, CM-2 SIMD parallel computer, performance evaluation, scalability, load balancing, resource allocation, parallel machines, trees (mathematics), search problems, tree search, SIMD machine, MIMD architectures, parallelarchitectures |
16 | Tao Yang 0009, Apostolos Gerasoulis |
DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 5(9), pp. 951-967, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
trees(mathematics), DSC, low-complexityheuristic, dominant sequence clustering algorithm, completely connected processor, unbounded number, nonzero communication overhead, arbitrary directedacyclic task graphs, special classes, coarse-grain trees, fine-grain trees, general scheduling algorithms, ETF, scheduling, performance, parallel algorithms, computational complexity, parallel programming, NP-complete, directed graphs, DAGs, join, optimal schedules, MD, fork, parallel task scheduling |
16 | Antonia Bertolino, Martina Marré |
Automatic Generation of Path Covers Based on the Control Flow Analysis of Computer Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 20(12), pp. 885-899, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
program branch testing, program flowgraph, program inputs, ddgraph, graph theoretic principles, arc trees, unconstrained arcs, implied tree, recursive iteration, software analysis tool, automated testing tool, software tools, program testing, flexibility, trees (mathematics), dominance, program diagnostics, control flow analysis, simplicity, implication, program control structures, flow graphs, dominator tree, selection strategy, infeasible paths, software testing tool, path covers |
16 | Wei Sun 0002, Clement T. Yu |
Semantic Query Optimization for Tree and Chain Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 6(1), pp. 136-151, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
chain queries, knowledge-based query optimization, semantically equivalent transformations, unnecessary joins, redundant beneficial/nonbeneficial selection operations, acyclic queries, closure chain queries, equi-join attributes, restriction closure computation, computational complexity, query processing, knowledge based systems, NP complete, time complexity, database theory, trees (mathematics), semantic query optimization, query graphs, tree queries |
16 | Akhil Kumar 0001 |
G-Tree: A New Data Structure for Organizing Multidimensional Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 6(2), pp. 341-347, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
G-tree, multidimensional data organisation, grid tree, ordering property, multidimensional space, partition numbers, dynamic data spaces, nonuniform data distributions, deletion operations, BD tree, zkdb tree, KDB tree, simulated bucket utilization rates, data structure, trees (mathematics), range queries, B-trees, tree data structures, data handling |
16 | Bruce A. Draper, Carla E. Brodley, Paul E. Utgoff |
Goal-Directed Classification Using Linear Machine Decision Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 16(9), pp. 888-893, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
goal-directed classification, linear machine decision trees, feature-based classification, nonparametric classification, linear machine decision tree, multivariate decision tree induction, misclassification cost functions, image understanding systems, pattern recognition, computer vision, trees (mathematics), inference mechanisms, decision theory, learning systems, pixel classification, inference algorithms |
16 | Eiichi Tanaka |
A Metric Between Unrooted and Unordered Trees and its Bottom-Up Computing Method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 16(12), pp. 1233-1238, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
unrooted trees, unordered trees, bottom-up computing method, strongly structure-preserving mapping, vertex correspondences, similar substructures, similar structure search, pattern recognition, computational complexity, dynamic programming, dynamic programming, pattern matching, pattern matching, similarity, time complexity, trees (mathematics), space complexity, distance metric, maximum degrees |
16 | I. S. I. Abuhaiba, Sabri A. Mahmoud, Roger J. Green |
Recognition of Handwritten Cursive Arabic Characters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 16(6), pp. 664-672, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
handwritten cursive Arabic characters, automatic off-line character recognition system, robust noise-independent algorithm, character skeleton, fuzzy constrained character graph models, fuzzily labeled arcs, optical character recognition, trees (mathematics), fuzzy set theory, tree structure |
16 | Jenn-Yang Tien, Ching-Tien Ho, Wei-Pang Yang |
Broadcasting on Incomplete Hypercubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 42(11), pp. 1393-1398, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
edge-disjoint spanning trees, delays, hypercube networks, trees (mathematics), broadcasting algorithm, incomplete hypercube, faulty nodes |
16 | Ananth Sankar, Richard J. Mammone |
Growing and Pruning Neural Tree Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 42(3), pp. 291-299, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
neural tree networks, pattern classification method, class label, classification errors, optimal pruning algorithm, function learning tasks, speaker independent vowel recognition, pattern recognition, learning (artificial intelligence), trees (mathematics), learning algorithm, feature space, self-organising feature maps |
16 | Mee Yee Chan, Shiang-Jen Lee |
Fault-Tolerant Embedding of Complete Binary Trees in Hypercubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 4(3), pp. 277-288, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
graph-theoretic question, simulation, computational complexity, NP-complete, hypercubes, hypercube networks, trees (mathematics), upper bound, complete binary trees, k-tree, fault tolerant embedding, fault tolerantcomputing |
16 | Josephine Micallef, Gail E. Kaiser |
Support Algorithms for Incremental Attribute Evaluation of Asynchronous Subtree Replacements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 19(3), pp. 231-252, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
incremental attribute evaluation, multiple asynchronous subtree replacements, arbitrary noncircular attribute grammars, multiple independent editing cursors, disjoint regions, derivation tree, computational complexity, complexity, trees (mathematics), attribute grammars, tree data structures, text editing, open problems |
16 | Gultekin Özsoyoglu, Aladdin Hafez |
Near-Optimum Storage Models for Nested Relations Based on Workload Information. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 5(6), pp. 1018-1038, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
near-optimum storage models, workload information, query cost, scheme tree, file organization types, nested relational algebra, dense index files, data structures, relational databases, storage management, trees (mathematics), relational algebra, database system, merges, nested relations |
16 | Takushi Tanaka |
Parsing Electronic Circuits in a Logic Grammar. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 5(2), pp. 225-239, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
trouble shooting, automatic circuit understanding, circuit structures, definite clause set grammar, DCSG top-down parsing mechanism, trees (mathematics), circuit analysis computing, grammars, structural analysis, formal logic, hierarchical structures, circuit design, words, parse trees, functional blocks, causal analysis, sentence, logic grammar |
16 | Predrag Minovic, Seiji Ishikawa, Kiyoshi Kato |
Symmetry Identification of a 3-D Object Represented by Octree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 15(5), pp. 507-514, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
symmetry identification, principal axis transform, complexity, image recognition, image recognition, trees (mathematics), octree, 3D object recognition |
16 | Shinji Umeyama |
Parameterized Point Pattern Matching and Its Application to Recognition of Object Families. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 15(2), pp. 136-144, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
object families, parameterized point pattern, tree search procedure, delta -boundedness, pruning methods, shape matching problem, pattern recognition, pattern matching, trees (mathematics), search problems |
16 | Majid Sarrafzadeh, C. K. Wong |
Bottleneck Steiner Trees in the Plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 41(3), pp. 370-374, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
bottleneck Steiner trees, maximum-weight edge minimized, linear decision tree model, communication network design, computational complexity, lower bound, optimisation, NP-complete, trees (mathematics), VLSI layout, location problems |
16 | Zhi-Jian (Alex) Mou, Francis Jutand |
"Overturned-Stairs" Adder Trees and Multiplier Design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 41(8), pp. 940-948, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
VLSI circuit layout, multioperand adders, Overturned-Stairs trees, 2's complement parallel multiplier, VLSI, logic design, digital arithmetic, trees (mathematics), adders, multiplying circuits, Wallace trees |
16 | Krishna P. Belkhale, Prithviraj Banerjee |
Reconfiguration Strategies for VLSI Processor Arrays and Trees Using a Modified Diogenes Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 41(1), pp. 83-96, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
reconfiguration strategies, VLSI processor arrays, Diogenes approach, rectangular arrays, VLSI, fault tolerant computing, trees, trees (mathematics), circuit layout CAD, complete binary tree |
16 | Mitchell L. Neilsen, Masaaki Mizuno |
Coterie Join Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 3(5), pp. 582-590, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
nonempty intersection, nonempty coteries, composite coterie, treecoteries, read and write quorums, replica control protocol, distributedalgorithms, distributed system, trees (mathematics), join algorithm |
16 | Anothai Rattarangsi, Roland T. Chin |
Scale-Based Detection of Corners of Planar Curves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 14(4), pp. 430-449, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
scale-based corners detection, Gaussian scale space, maxima of absolute curvature, boundary function, line patterns, multiple-scale corner detection, coarse-to-fine tree parsing technique, pattern recognition, pattern recognition, picture processing, picture processing, tree, trees (mathematics), filtering and prediction theory, planar curves, stability criterion |
16 | Ajay K. Gupta 0001, Susanne E. Hambrusch |
Embedding Complete Binary Trees into Butterfly Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 40(7), pp. 853-863, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
wrap-around connections, multiprocessor interconnection networks, embeddings, trees (mathematics), complete binary trees, butterfly networks |
16 | Abdol-Hossein Esfahanian, Lionel M. Ni, Bruce E. Sagan |
The Twisted N-Cube with Application to Multiprocessing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 40(1), pp. 88-93, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
twisted N-cube, n-regular graphs, graph theory, connectivity, hypercube networks, trees (mathematics), multiprocessing, disjoints paths, hypercube multiprocessors, complete binary tree, subgraph |
16 | O. J. Murphy, R. L. McCraw |
Designing Storage Efficient Decision Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 40(3), pp. 315-320, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
storage efficient decision trees, storage optimal decision tree, information-theoretic heuristic, computational complexity, computational complexity, data structures, trees (mathematics), decision theory, NP-complete problem, decision tables, decision tables |
16 | Gopalakrishnan Vijayan |
Generalization of Min-Cut Partitioning to Tree Structures and Its Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 40(3), pp. 307-314, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
min-cut partitioning, hyperedges, VLSI design applications, iterative improvement heuristic, routing, computational complexity, data structures, trees (mathematics), hypergraph, minimisation, minimisation, tree structures, vertices, cost function, nodes, pins |
16 | Richard A. Kemmerer, Phillip A. Porras |
Covert Flow Trees: A Visual Approach to Analyzing Covert Storage Channels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 17(11), pp. 1166-1185, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
covert storage channels, covert flow tree, listening process, resource attribute, covert channel operation sequences, trees (mathematics), security of data, attributes, tree structure |
16 | Witold Litwin, Nick Roussopoulos, Gérald Lévy, Wang Hong |
Trie Hashing With Controlled Load. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 17(7), pp. 678-691, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
primary key access method, dynamic files, key search, trie hashing, controlled load, THCL, TH file, B-tree file, high load factor, ordered insertions, random insertions, trees (mathematics), file organisation, information retrieval systems, load factor, load factor, disk access |
16 | Subhada K. Mishra, Vijay V. Raghavan 0001, Nian-Feng Tzeng |
Efficient Algorithms For Selection of Recovery Points in Tree Task Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 17(7), pp. 731-734, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
tree task models, recovery points, task precedence, uniprocessor environment, binary tree model, exponential time requirements, arbitrary tree model, computational complexity, optimisation, time complexity, trees (mathematics), tree structure |
16 | Hermann Kaindl, Reza Shams, Helmut Horacek |
Minimax Search Algorithms With and Without Aspiration Windows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 13(12), pp. 1225-1235, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
minimax search algorithms, aspiration windows, exact minimax values, backward pruning, linear space complexity, alpha-beta search, computational complexity, game theory, trees (mathematics), search problems, uniform distribution, minimax techniques, game trees |
16 | Xiao-Jia M. Zhou, Tharam S. Dillon |
A Statistical-Heuristic Feature Selection Criterion for Decision Tree Induction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 13(8), pp. 834-841, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
statistical-heuristic feature selection criterion, multibranching decision trees, built-in statistical test, proportional-reduction-in-error, cost-of-complexity heuristic, middle-cut preference, tau criterion, prepruning, dynamic error estimation, pattern recognition, pattern recognition, robustness, statistics, trees (mathematics), decision theory, Bayes methods, Bayesian classifier, decision tree induction |
16 | Philip A. Chou |
Optimal Partitioning for Classification and Regression Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 13(4), pp. 340-354, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
Kullback's information divergence, surrogate splits, composite nodes, speech recognition, speech recognition, partitioning, iterative methods, trees (mathematics), decision theory, clustering algorithm, iterative algorithm, text-to-speech, regression trees, decision graphs |
16 | Saul B. Gelfand, C. S. Ravishankar, Edward J. Delp |
An Iterative Growing and Pruning Algorithm for Classification Tree Design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 13(2), pp. 163-174, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
pruning algorithm, classification tree design, right-sized trees, terminal nodes, waveform recognition problem, pattern recognition, pattern recognition, iterative method, iterative methods, trees (mathematics), Bayes methods, Bayes methods, estimation theory, estimation theory, stopping rules |
16 | Sakti Pramanik, Myoung-Ho Kim |
Parallel Processing of Large Node B-Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 39(9), pp. 1208-1212, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
large node B-trees, tree height, parallel algorithms, parallel processing, parallel processing, concurrency, trees (mathematics), response time, B-trees |
16 | Hon Fung Li, David K. Probst |
Optimal VLSI Dictionary Machines Without Compress Instructions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 39(5), pp. 676-693, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
optimal VLSI dictionary machines, logarithmic network, design objectives, single-cycle operability, logarithmic network, VLSI, database management systems, trees (mathematics), special purpose computers, linear network, query trees |
16 | Jia-Shung Wang, Richard C. T. Lee |
An Efficient Channel Routing Algorithm to Yield an Optimal Solution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 39(7), pp. 957-962, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
channel routing algorithm, dominance rules, VAX 11/750 computer, VLSI, heuristics, Pascal, trees (mathematics), VLSI design, circuit layout CAD, searching tree, optimal solution |
16 | Yigal Brandman, Alon Orlitsky, John L. Hennessy |
A Spectral Lower Bound Techniqye for the Size of Decision Trees and Two Level AND/OR Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 39(2), pp. 282-287, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
spectral lower bound technique, two-level AND/OR circuits, arbitrary Boolean function, power spectrum coefficients, n dimensional Fourier transform, decision trees, Boolean functions, trees (mathematics), Fourier transforms, logic circuits |
16 | Krishna Kant 0001, A. Ravichandran |
Synthesizing Robust Data STructures - An Introduction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 39(2), pp. 161-173, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
robust data structures, data elements, concurrent repair, disjoint portions, databases, data structures, fault tolerant computing, synthesis, trees (mathematics), first-order logic, B-trees, attributes, axioms, formal approach |
16 | Laurie J. Hendren, Alexandru Nicolau |
Parallelizing Programs with Recursive Data Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 1(1), pp. 35-47, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
disambiguation techniques, interference analysis tools, parallelization techniques, dynamically updatable trees, regular-expression-like representation, accessible nodes, parallel programming, data structures, directed graphs, interference, program compilers, trees (mathematics), directed acyclic graphs, parallelizing compilers, automatic parallelization, dynamic data structures, parallel programming languages, recursive data structures, imperative programs, imperative language |
16 | Guo-Jie Li, Benjamin W. Wah |
Computational Efficiency of Parallel Combinatorial OR-Tree Searches. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 16(1), pp. 13-31, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
near linear speedup, parallel combinatorial OR-tree searches, error allowance function, simulation, performance evaluation, performance, parallel processing, theorem proving, database management systems, trees (mathematics), decision theory, sufficient conditions, search strategies, combinatorial mathematics, dominance relation |
16 | Sheau-Dong Lang, Yannis Manolopoulos |
Efficient Expressions for Completely and Partly Unsuccessful Batched Search of Tree-Structured Files. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 16(12), pp. 1433-1435, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
nonrecurrent expressions, partly unsuccessful batched searching, complete j-ary tree files, nonreplacement models, search queries, block accesses, hierarchical file structures, batch processing (computers), data structures, database management systems, trees (mathematics), search problems, information retrieval systems |
16 | Yin-Fu Huang, Yeh-Hao Chin |
A New Methodology to Evaluate Locking Protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 2(4), pp. 431-435, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
average lock range, evaluation factor, locking-based concurrency control methods, nonstructural locking, ALR, popular locking protocols, 2PL protocol, tree protocol, simulation, protocols, distributed databases, concurrency control, correctness, trees (mathematics), queueing model |
16 | Chuan-Heng Ang, Hanan Samet, Clifford A. Shaffer |
A New Region Expansion for Quadtrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 12(7), pp. 682-686, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
region expansion, one-pass algorithm, white pixels, black mode, black nodes, merging cluster, vertex set, pattern recognition, pattern recognition, picture processing, trees (mathematics), quadtrees |
16 | Marc Parizeau, Réjean Plamondon |
A Comparative Analysis of Regional Correlation, Dynamic Time Warping, and Skeletal Tree Matching for Signature Verification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 12(7), pp. 710-717, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
regional correlation, skeletal tree matching, signal matching algorithms, verification error rates, script types, handwritten passwords, signal representation spaces, character recognition, character recognition, computerised pattern recognition, trees (mathematics), dynamic time warping, signature verification, correlation methods |
16 | Homer H. Chen, Thomas S. Huang |
Matching 3-D Line Segments with Applications to Multiple-Object Motion Estimation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 12(10), pp. 1002-1008, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
3-D line segments, multiple-object motion estimation, sign ambiguity, congruency constraint, Hough clustering technique, global consistency, object model construction, pattern recognition, pattern recognition, object recognition, matching, trees (mathematics), search problems, tree-search, two-stage algorithm, stereo image sequences |
16 | Lawrence M. Lifshitz, Stephen M. Pizer |
A Multiresolution Hierarchical Approach to Image Segmentation Based on Intensity Extrema. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 12(6), pp. 529-540, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
multiresolution hierarchical approach, intensity extrema, image description, image segmentation, computerised picture processing, trees (mathematics), computer tomography, scene analysis, tree structure, computerised tomography, gray-scale images |
16 | Gita Alaghband, Harry F. Jordan |
Sparse Gaussian Elimination with Controlled Fill-in on a Shared Memory Multiprocessor. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 38(11), pp. 1539-1557, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
controlled fill-in, ordered compatible set, Markowitz number, limited binary tree search, elimination set, parallel pivoting, stepwise algorithm, application matrices, HEP multiprocessor, parallel algorithms, computational complexity, parallel processing, shared memory multiprocessor, trees (mathematics), heuristic algorithm, matrix algebra, sparse matrix, linear time, sparse Gaussian elimination |
16 | Hee Yong Youn, Adit D. Singh |
On Implementing Large Binary Tree Architectures in VLSI and WSI. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 38(4), pp. 526-537, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
large binary tree architectures, maximum edge length, H-tree layouts, VLSI, VLSI, layout, trees (mathematics), circuit layout CAD, processing elements, propagation delay, fault-tolerant designs, WSI, two-dimensional array |
16 | Ravi S. Sandhu |
Recognizing Immediacy in an N-Tree Hierarchy and Its Application to Protection Groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 15(12), pp. 1518-1525, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
immediacy, N-tree hierarchy, protection groups, subgroup relation, inverted rooted trees, access control, data structures, refinement, trees (mathematics), recursively, security of data, set theory, granularity, partial order, multi-access systems, linear orderings, integers |
16 | Shyh-Kwei Chen, Wei-Tek Tsai, Bhavani M. Thuraisingham |
Recovery Point Selection on a Reverse Binary Tree Task Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 15(8), pp. 963-976, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
performance computation procedure, computation time minimization, recovery point selection, reverse binary tree task model, arbitrary reverse tree model, optimal placement algorithm, closed form formula, recovery point placement problem, computational complexity, fault tolerant computing, multiprocessing systems, multiprocessor systems, trees (mathematics), communication delays, closed form solution, uniprocessor systems |
16 | Jun-Ichi Aoe |
An Efficient Digital Search Algorithm by Using a Double-Array Structure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 15(9), pp. 1066-1077, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
digital search algorithm, double-array structure, internal array structure, matrix form, list form, digital search tree, DS-tree, worst-case time complexity, input symbols, constant, computational complexity, data structures, retrieval, trees (mathematics), search problems, nodes, insertion, deletion, key, arc |
16 | Raghavachari Sriraman, Jack Koplowitz, Seshadri Mohan |
Tree Searched Chain Coding for Subpixel Reconstruction of Planar Curves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 11(1), pp. 95-104, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
tree searched chain encoding, subpixel reconstruction, reconstruction distortion, computerised picture processing, computerised picture processing, encoding, trees (mathematics), quantization, filtering and prediction theory, line drawings, chain codes, planar curves, linear filtering |
16 | Charles D. Hansen, Thomas C. Henderson |
CAGD-Based Computer Vision. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 11(11), pp. 1181-1193, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
3D shape recognition, strategy tree, computer vision, computer vision, robustness, CAD, consistency, computerised pattern recognition, computerised pattern recognition, completeness, trees (mathematics), solid modelling, computer-aided geometric design, CAGD, search process |
16 | Jonathan Schaeffer |
The History Heuristic and Alpha-Beta Search Enhancements in Practice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 11(11), pp. 1203-1212, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
history heuristic, alpha-beta search enhancements, minimax trees, interior nodes, transposition tables, trees (mathematics), search problems, minimax techniques, game trees |
16 | Jean-Marie Beaulieu, Morris Goldberg |
Hierarchy in Picture Segmentation: A Stepwise Optimization Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 11(2), pp. 150-163, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
picture segmentation, stepwise optimization, data structure, optimisation, tree, computerised picture processing, computerised picture processing, iterative methods, iterative methods, trees (mathematics), hierarchical decomposition, sequential optimization |
16 | Peter Strobach |
Quadtree-Structured Linear Prediction Models for Image Sequence Processing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 11(7), pp. 742-748, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
two-dimensional linear prediction models, scene coding, interframe relationships, block-adaptive interframe predictor, interframe predictive coding, spatial nonstationarity, quadtree segmentation structure, maximum-likelihood criterion, minimum-variance criterion, pattern recognition, pattern recognition, picture processing, picture processing, encoding, encoding, trees (mathematics), change detection, filtering and prediction theory, image sequence processing |
16 | Chiun-Hong Chien, J. K. Aggarwal |
Model Construction and Shape Recognition from Occluding Contours. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 11(4), pp. 372-389, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
2D silhouette, volume/surface octree, pattern recognition, pattern recognition, picture processing, picture processing, trees (mathematics), quadtrees, shape recognition, feature points, 3D object, occluding contours, contour matching |
16 | Narendra Ahuja, Jack Veenstra |
Generating Octrees from Object Silhouettes in Orthographic Views. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 11(2), pp. 137-149, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
object silhouettes, orthographic views, octree representation, face views, edge views, corner views, octant labels, pattern recognition, picture processing, trees (mathematics), table lookup, 3D object |
16 | S. K. Michael Wong, F. C. S. Poon |
Comments on Approximating Discrete Probability Distributions with Dependence Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 11(3), pp. 333-335, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
discrete probability distributions, product approximation, tree dependence approximation, classification, pattern recognition, pattern recognition, probability, trees (mathematics), minimization, Bayes methods, minimisation, probability distribution, approximation theory, error statistics, Bayes error rate |
16 | Jik H. Chang, Oscar H. Ibarra, Moon-Jung Chung, Kotesh K. Rao |
Systolic Tree Implementation of Data Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 37(6), pp. 727-735, 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
systolic tree implementation, dequeues, unit response time, unit pipeline interval, data elements, data structures, data structures, queueing theory, trees (mathematics), queues, stacks, data transmission, dictionary machines |
16 | N. Chandrasekharan, S. Sitharama Iyengar |
NC Algorithms for Recognizing Chordal Graphs and k Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 37(10), pp. 1178-1183, 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
chordal graph recognition, parallel algorithms, parallel algorithms, graph theory, trees (mathematics), PRAM, k trees, NC algorithms |
Displaying result #1 - #100 of 113 (100 per page; Change: ) Pages: [ 1][ 2][ >>] |
|