|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 11308 occurrences of 4427 keywords
|
|
|
Results
Found 28581 publication records. Showing 28571 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
20 | Alan S. Wagner |
Embedding all binary trees in the hypercube. |
SPDP |
1991 |
DBLP DOI BibTeX RDF |
|
20 | Philippe Darondeau, Pierpaolo Degano |
Causal Trees: Interleaving + Causality. |
Semantics of Systems of Concurrent Processes |
1990 |
DBLP DOI BibTeX RDF |
concurrency, bisimulation, causality, non-determinism |
20 | Jon Louis Bentley |
K-d Trees for Semidynamic Point Sets. |
SCG |
1990 |
DBLP DOI BibTeX RDF |
C++ |
20 | Alexandros Biliris |
Operation Specific Locking in B-Trees. |
PODS |
1987 |
DBLP DOI BibTeX RDF |
|
20 | Sami Khuri |
Counting nodes in binary trees. |
SIGCSE |
1986 |
DBLP DOI BibTeX RDF |
|
20 | Rainer Kemp |
On a General Weight of Trees. |
STACS |
1984 |
DBLP DOI BibTeX RDF |
|
20 | Jürg Nievergelt, C. K. Wong |
Upper Bounds for the Total Path Length of Binary Trees. |
J. ACM |
1973 |
DBLP DOI BibTeX RDF |
|
19 | S. M. Hadi Hosseini, Makoto Takahashi |
Combining Static/Dynamic Fault Trees and Event Trees Using Bayesian Networks. |
SAFECOMP |
2007 |
DBLP DOI BibTeX RDF |
|
19 | Sheung-Hung Poon |
On Unfolding Lattice Polygons/Trees and Diameter-4 Trees. |
COCOON |
2006 |
DBLP DOI BibTeX RDF |
Comput. geom., straightening, convexifying, unfolding |
19 | Ulrike Stege |
Gene Trees and Species Trees: The Gene-Duplication Problem in Fixed-Parameter Tractable. |
WADS |
1999 |
DBLP DOI BibTeX RDF |
|
19 | Guo-Hui Lin, Guoliang Xue |
Balancing Steiner minimum trees and shortest-path trees in the rectilinear plane. |
ISCAS (6) |
1999 |
DBLP DOI BibTeX RDF |
|
19 | François Bergeron, Philippe Flajolet, Bruno Salvy |
Varieties of Increasing Trees. |
CAAP |
1992 |
DBLP DOI BibTeX RDF |
|
19 | Clemens Lautemann |
Decomposition Trees: Structured Graph Representation and Efficient Algorithms. |
CAAP |
1988 |
DBLP DOI BibTeX RDF |
|
19 | René Schott |
Random Walks on Trees. |
CAAP |
1986 |
DBLP DOI BibTeX RDF |
method of Darboux, generator, tree, Random walk, generating function, dynamic data structure, asymptotic behavior |
19 | Rafael Casas, Jean-Marc Steyaert |
Bottom-Up Recursion in Trees. |
CAAP |
1986 |
DBLP DOI BibTeX RDF |
|
19 | Reouven Elbaz, David Champagne, Catherine H. Gebotys, Ruby B. Lee, Nachiketh R. Potlapally, Lionel Torres |
Hardware Mechanisms for Memory Authentication: A Survey of Existing Techniques and Engines. |
Trans. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
Memory Authentication, Integrity Trees, Board level attacks, Security, Trusted Computing, Active attacks |
19 | John William Lumley |
Automated extensible XML tree diagrams. |
ACM Symposium on Document Engineering |
2009 |
DBLP DOI BibTeX RDF |
svg, xml trees, functional programming, xslt |
19 | Ramana Chakradhar Jandhyala, Mukkai S. Krishnamoorthy, George Nagy, Raghav K. Padmanabhan, Sharad C. Seth, William Silversmith |
From Tessellations to Table Interpretation. |
Calculemus/MKM |
2009 |
DBLP DOI BibTeX RDF |
rectangular tilings, X-Y trees, table grammars, Wang notation, tables, document understanding |
19 | Seung-Jin Sul, Tiffani L. Williams |
An Experimental Analysis of Robinson-Foulds Distance Matrix Algorithms. |
ESA |
2008 |
DBLP DOI BibTeX RDF |
RF distance, performance analysis, phylogenetic trees |
19 | Hua-Huai Chern, Michael Fuchs 0001, Hsien-Kuei Hwang |
Phase changes in random point quadtrees. |
ACM Trans. Algorithms |
2007 |
DBLP DOI BibTeX RDF |
Asymptotic transfer, analysis in distribution of algorithms, grid trees, local limit theorems, page usage, total path length, quadtrees, differential equations, phase transitions, depth, central limit theorems, Mellin transforms |
19 | Frédéric Magniez, Michel de Rougemont |
Property Testing of Regular Tree Languages. |
Algorithmica |
2007 |
DBLP DOI BibTeX RDF |
Edit distance with moves, Property testing, Regular trees languages |
19 | Ivaylo Atanassov |
An improvement of an approach for representation of tree structures in relational tables. |
CompSysTech |
2007 |
DBLP DOI BibTeX RDF |
path enumeration model, relational databases, SQL, trees, hierarchies, relational tables |
19 | Filip De Greve, Frederic Van Quickenborne, Filip De Turck, Ingrid Moerman, Piet Demeester |
Optimizing Routing Schemes for Fast Moving Users in MST-Based Networks. |
EuroNGI Workshop |
2005 |
DBLP DOI BibTeX RDF |
spanning trees, Ethernet, user mobility |
19 | Michael J. McGuffin, Ravin Balakrishnan |
Interactive Visualization of Genealogical Graphs. |
INFOVIS |
2005 |
DBLP DOI BibTeX RDF |
family trees, kinship, multitrees, graph browsing and navigation, graph theory, graph drawing, genealogy, genealogies |
19 | Luay Nakhleh, Tandy J. Warnow, C. Randal Linder |
Reconstructing reticulate evolution in species: theory and practice. |
RECOMB |
2004 |
DBLP DOI BibTeX RDF |
gene trees, subtree prune and regraft, phylogenetic networks |
19 | Lian Wen, R. Geoff Dromey |
From Requirements Change to Design Change: A Formal Path. |
SEFM |
2004 |
DBLP DOI BibTeX RDF |
traceability analysis, genetic software engineering, requirements engineering, software evolution, Software change, behavior trees, software automation |
19 | Vicent Estruch, César Ferri, José Hernández-Orallo, M. José Ramírez-Quintana |
Beam Search Extraction and Forgetting Strategies on Shared Ensembles. |
Multiple Classifier Systems |
2003 |
DBLP DOI BibTeX RDF |
Randomisation, Decision Trees, Ensemble Methods, Search Space, Beam Search |
19 | Alejandro Murua |
Upper Bounds for Error Rates of Linear Combinations of Classifiers. |
IEEE Trans. Pattern Anal. Mach. Intell. |
2002 |
DBLP DOI BibTeX RDF |
Exponential bounds, weakly dependent classifiers, machine learning, classification trees |
19 | Taghi M. Khoshgoftaar, Naeem Seliya |
Tree-Based Software Quality Estimation Models For Fault Prediction. |
IEEE METRICS |
2002 |
DBLP DOI BibTeX RDF |
least absolute deviation, least squares, cart, regression trees, software fault prediction, s-plus |
19 | Gianluca Della Vedova, Todd Wareham |
Optimal algorithms for local vertex quartet cleaning. |
SAC |
2002 |
DBLP DOI BibTeX RDF |
quartet-based methods, algorithms, evolutionary trees |
19 | Taghi M. Khoshgoftaar, Naeem Seliya |
Software Quality Classification Modeling Using The SPRINT Decision Tree Algorithm. |
ICTAI |
2002 |
DBLP DOI BibTeX RDF |
software quality estimation, IBM Intelligent Data Miner, software metrics, classification trees, minimum description length principle |
19 | András Frank, László Szegö |
An Extension of a Theorem of Henneberg and Laman. |
IPCO |
2001 |
DBLP DOI BibTeX RDF |
constructive characterization, packing and covering by trees AMS subject classification. 05C40, graph, rigidity |
19 | Philip Bohannon, Peter McIlroy, Rajeev Rastogi |
Main-Memory Index Structures with Fixed-Size Partial Keys. |
SIGMOD Conference |
2001 |
DBLP DOI BibTeX RDF |
T-tree, main-memory indices, cache coherence, B-trees, key compression |
19 | Rui Camacho, Pavel Brazdil |
Improving the Robustness and Encoding Complexity of Behavioural Clones. |
ECML |
2001 |
DBLP DOI BibTeX RDF |
behavioural cloning, decision trees, cognitive modeling |
19 | Byung-Kyu Choi, Riccardo Bettati |
Efficient resource management for hard real-time communication over differentiated services architectures. |
RTCSA |
2000 |
DBLP DOI BibTeX RDF |
hard real-time communication, differentiated services architectures, sink trees, admission probability, link resource utilization, resource allocation, resource management, heuristic algorithm, NP-complete problem, resource reservation, computer network management, telecommunication services, simulation experiments |
19 | Lowell L. Winger, Anastasios N. Venetsanopoulos |
Stack-Run Coding with Space-Frequency Quantization. |
ICIP (1) |
1997 |
DBLP DOI BibTeX RDF |
stack-run coding, wavelet image compression, space-frequency scalar quantization, wavelet quantization, low addressing complexity, fast parallel decoding, dead-zone scalar quantizers, raster scan pattern selection, spatial optimization, quantization coefficients, nonrecursive optimal algorithms, lossy wavelet image coders, zero-trees, performance, data compression, system design, simulation results, PSNR, performance gains, local optimization, coding efficiency, run-length coding, subbands |
19 | George Jyh-Shian Chang, Girish Patel, Liam Relihan, Jason Tsong-Li Wang |
A graphical environment for change detection in structured documents. |
COMPSAC |
1997 |
DBLP DOI BibTeX RDF |
graphical environment, Internet databases, ordered labeled tree, graphical devices, syntactic differences, program versions, algorithms, digital libraries, software maintenance, pattern matching, pattern matching, configuration management, data warehousing, change detection, version control, SGML, document management, operator, pattern discovery, structured documents, markup language, parse trees |
19 | Feng Bao 0004, Yutaka Funyu, Yukihiro Hamada, Yoshihide Igarashi |
Reliable broadcasting and secure distributing in channel networks. |
ISPAN |
1997 |
DBLP DOI BibTeX RDF |
channel networks, secure message distributing, message distribution schemes, secret sharing, spanning trees, security of data, reliable broadcasting, fault-tolerant communication |
19 | Maurice Herlihy, Beng-Hong Lim, Nir Shavit |
Scalable Concurrent Counting. |
ACM Trans. Comput. Syst. |
1995 |
DBLP DOI BibTeX RDF |
combining trees, counting networks |
18 | Benjamin Aram Berendsohn, Ishay Golinsky, Haim Kaplan, László Kozma 0002 |
Fast Approximation of Search Trees on Trees with Centroid Trees. |
ICALP |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Jonathan Klawitter, Felix Klesen, Moritz Niederer, Alexander Wolff 0001 |
Visualizing Multispecies Coalescent Trees: Drawing Gene Trees Inside Species Trees. |
SOFSEM |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Benjamin Aram Berendsohn, Ishay Golinsky, Haim Kaplan, László Kozma 0002 |
Fast approximation of search trees on trees with centroid trees. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Jonathan Klawitter, Felix Klesen, Moritz Niederer, Alexander Wolff 0001 |
Visualizing Multispecies Coalescent Trees: Drawing Gene Trees Inside Species Trees. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Mercè Llabrés, Francesc Rosselló, Gabriel Valiente |
A Generalized Robinson-Foulds Distance for Clonal Trees, Mutation Trees, and Phylogenetic Trees and Networks. |
BCB |
2020 |
DBLP DOI BibTeX RDF |
|
18 | Svante Janson |
Random Recursive Trees and Preferential Attachment Trees are Random Split Trees. |
Comb. Probab. Comput. |
2019 |
DBLP DOI BibTeX RDF |
|
18 | Nikolett Bereczky, Amalia Duch, Krisztián Németh, Salvador Roura |
Quad-kd trees: A general framework for kd trees and quad trees. |
Theor. Comput. Sci. |
2016 |
DBLP DOI BibTeX RDF |
|
18 | Ratko Orlandic, Hosam M. Mahmoud |
Storage Overhead of O-Trees, B-Trees and Prefix B-Trees: A Comparative Analysis. |
Int. J. Found. Comput. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
18 | Chris L. Jackins, Steven L. Tanimoto |
Quad-Trees, Oct-Trees, and K-Trees: A Generalized Approach to Recursive Decomposition of Euclidean Space. |
IEEE Trans. Pattern Anal. Mach. Intell. |
1983 |
DBLP DOI BibTeX RDF |
|
18 | Jennifer A. Smith 0001 |
RNA Search with Decision Trees and Partial Covariance Models. |
IEEE ACM Trans. Comput. Biol. Bioinform. |
2009 |
DBLP DOI BibTeX RDF |
covariance models, RNA database search, decision trees, Bioinformatics, computational intelligence |
18 | Khalil Djelloul |
From exponential to almost linear decomposability of finite or infinite trees. |
SAC |
2009 |
DBLP DOI BibTeX RDF |
solving first order constraints, theory of trees, first-order logic, rewriting rules |
18 | Mori Kurokawa, Hiroyuki Yokoyama, Akito Sakurai |
Averaged Naive Bayes Trees: A New Extension of AODE. |
ACML |
2009 |
DBLP DOI BibTeX RDF |
augmented naive Bayes, averaged one-dependence estimators, naive Bayes trees, model averaging, naive Bayes |
18 | Hichem Boudali, A. P. Nijmeijer, Mariëlle Stoelinga |
DFTSim: a simulation tool for extended dynamic fault trees. |
SpringSim |
2009 |
DBLP DOI BibTeX RDF |
reliability benchmark, dependability analysis, simulation tool, dynamic fault trees |
18 | Pei-Pei Li 0001, Xuegang Hu, Qianhui Liang, Yunjun Gao |
Concept Drifting Detection on Noisy Streaming Data in Random Ensemble Decision Trees. |
MLDM |
2009 |
DBLP DOI BibTeX RDF |
Ensemble Decision Trees, Data Streams, Noise, Concept Drift |
18 | Puntip Pattaraintakorn |
Entropy Measures of Flow Graphs with Applications to Decision Trees. |
RSKT |
2009 |
DBLP DOI BibTeX RDF |
Decision trees, Entropy, Flow graphs |
18 | Benoît Naegel, Nicolas Passat |
Component-Trees and Multi-value Images: A Comparative Study. |
ISMM |
2009 |
DBLP DOI BibTeX RDF |
Component-trees, multi-value images, connected operators |
18 | Benoît Caldairou, Benoît Naegel, Nicolas Passat |
Segmentation of Complex Images Based on Component-Trees: Methodological Tools. |
ISMM |
2009 |
DBLP DOI BibTeX RDF |
Component-trees, attribute-filtering, segmentation, grey-level images |
18 | Michael Brydon, Andrew Gemino |
Classification trees and decision-analytic feedforward control: a case study from the video game industry. |
Data Min. Knowl. Discov. |
2008 |
DBLP DOI BibTeX RDF |
Probability estimation trees, Decision tree analysis, Video game development, Data mining, Real options |
18 | Cun-Quan Zhang, Yongbin Ou |
Clustering, community partition and disjoint spanning trees. |
ACM Trans. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
dynamic density, clustering, community, hierarchical clustering, Spanning trees, polynomial algorithm, dense subgraph |
18 | Reuven Bar-Yehuda, Ido Feldman, Dror Rawitz |
Improved Approximation Algorithm for Convex Recoloring of Trees. |
Theory Comput. Syst. |
2008 |
DBLP DOI BibTeX RDF |
Convex recoloring, Approximation algorithms, Phylogenetic trees, Local ratio |
18 | Nikolay Malitsky |
Processing heterogeneous abstract syntax trees with the mutable class pattern. |
OOPSLA Companion |
2008 |
DBLP DOI BibTeX RDF |
heterogeneous trees, mutable class pattern, OOP, AOP, visitor pattern |
18 | Lei Wang 0002, Nicholas J. Dingle, William J. Knottenbelt |
Natural Language Specification of Performance Trees. |
EPEW |
2008 |
DBLP DOI BibTeX RDF |
Performance requirements specification, Performance Trees, Performance analysis, Natural language |
18 | Francisco J. Almeida-Martínez, Jaime Urquiza-Fuentes, J. Ángel Velázquez-Iturbide |
VAST: visualization of abstract syntax trees within language processors courses. |
SOFTVIS |
2008 |
DBLP DOI BibTeX RDF |
visualization, abstract syntax trees |
18 | Cédric Simon, Jérôme Meessen, Christophe De Vleeschouwer |
Using decision trees to recognize visual events. |
AREA |
2008 |
DBLP DOI BibTeX RDF |
automated visual surveillance system, activity recognition, randomized decision trees |
18 | Sébastien Destercke, Gert de Cooman |
Relating Epistemic Irrelevance to Event Trees. |
SMPS |
2008 |
DBLP DOI BibTeX RDF |
Forward irrelevance, Event trees, Stochastic process, Independence |
18 | Gary R. Weckman, Andrew P. Snow, Preeti Rastogi, Maimuna H. Rangwala |
Assessing Wireless Network Dependability through Knowledge Extraction via Decision Trees. |
ICONS |
2008 |
DBLP DOI BibTeX RDF |
Wireless Network, Artificial Neural Networks, Decision Trees, Dependability |
18 | Jeff Abrahamson, Béla Csaba, Ali Shokoufandeh |
Optimal Random Matchings on Trees and Applications. |
APPROX-RANDOM |
2008 |
DBLP DOI BibTeX RDF |
Random Matching, Hierarchically Separated Trees, Supremum Bounds |
18 | Pei-Pei Li 0001, Xuegang Hu, Xindong Wu 0001 |
Mining Concept-Drifting Data Streams with Multiple Semi-Random Decision Trees. |
ADMA |
2008 |
DBLP DOI BibTeX RDF |
Classification, Data Streams, Concept Drift, Random Decision Trees |
18 | Arne Andersson, Mikkel Thorup |
Dynamic ordered sets with exponential search trees. |
J. ACM |
2007 |
DBLP DOI BibTeX RDF |
ordered lists, Search trees |
18 | Priscila C. Berbert, Leonardo J. R. Freitas Filho, Tiago A. Almeida 0001, Márcia B. Carvalho, Akebo Yamakami |
Artificial Immune System to Find a Set of k -Spanning Trees with Low Costs and Distinct Topologies. |
ICARIS |
2007 |
DBLP DOI BibTeX RDF |
Artificial Immune Systems, Spanning Trees, Bio-inspired Computing |
18 | Radhika M. Pai, V. S. Ananthanarayana |
Prefix-Suffix Trees: A Novel Scheme for Compact Representation of Large Datasets. |
PReMI |
2007 |
DBLP DOI BibTeX RDF |
Pattern- Count(PC) tree, Prefix-Suffix Trees, Data mining, Clustering, Abstraction, Incremental mining |
18 | Moonseong Kim, Minseok Kang, Hyunseung Choo, Jong S. Yang, Young-Cheol Bang |
On Efficiency Group Multicasting Algorithm with Multiple Minimum Steiner Trees. |
International Conference on Computational Science (3) |
2007 |
DBLP DOI BibTeX RDF |
Group Multicast Routing Algorithm, Minimum Steiner Trees, Group KMB (GKMB) Algorithm and Minimum Cost Multicast Tree (MCMT) Algorithm |
18 | Anneleen Van Assche, Hendrik Blockeel |
Seeing the Forest Through the Trees: Learning a Comprehensible Model from an Ensemble. |
ECML |
2007 |
DBLP DOI BibTeX RDF |
decision trees, ensembles, comprehensibility |
18 | Kevin R. Hutson, Douglas R. Shier |
Minimum spanning trees in networks with varying edge weights. |
Ann. Oper. Res. |
2006 |
DBLP DOI BibTeX RDF |
Reliability, Networks, Sensitivity analysis, Spanning trees, Cutsets, Stochastic networks |
18 | Robert M. Bell, Patrick Haffner, Chris Volinsky |
Modifying boosted trees to improve performance on task 1 of the 2006 KDD challenge cup. |
SIGKDD Explor. |
2006 |
DBLP DOI BibTeX RDF |
boosted trees, nonstandard loss function, real AdaBoost, classification, multiple instance learning |
18 | Khalil Djelloul, Thi-Bich-Hanh Dao |
Solving first-order constraints in the theory of finite or infinite trees: introduction to the decomposable theories. |
SAC |
2006 |
DBLP DOI BibTeX RDF |
complete theory, first-order constraints, theory of trees, two partners games, rewriting rules |
18 | Natarajan Meghanathan |
Determining a sequence of stable multicast Steiner trees in mobile ad hoc networks. |
ACM Southeast Regional Conference |
2006 |
DBLP DOI BibTeX RDF |
simulation, mobile ad hoc networks, stability, multicast trees |
18 | Wei Fan 0001, Joe McCloskey, Philip S. Yu |
A general framework for accurate and fast regression by data summarization in random decision trees. |
KDD |
2006 |
DBLP DOI BibTeX RDF |
decision trees, random, regression |
18 | Yun Li, Chunjing Xu, Jianzhuang Liu, Xiaoou Tang |
Detecting irregularity in videos using kernel estimation and KD trees. |
ACM Multimedia |
2006 |
DBLP DOI BibTeX RDF |
irregularity detection, kernels, MAP estimation, K-D trees |
18 | Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin |
Two-variable logic on data trees and XML reasoning. |
PODS |
2006 |
DBLP DOI BibTeX RDF |
data trees, first-order logic, decidability |
18 | Piotr Berman, Martin Fürer, Alexander Zelikovsky |
Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees. |
CSR |
2006 |
DBLP DOI BibTeX RDF |
parity matroid problem, Steiner trees, matroid, approximation ratio |
18 | Jung-Heum Park, Hyeong-Seok Lim, Hee-Chul Kim |
Embedding Starlike Trees into Hypercube-Like Interconnection Networks. |
ISPA Workshops |
2006 |
DBLP DOI BibTeX RDF |
restricted HL-graphs, path partition, interconnection networks, Spanning trees |
18 | Luís Pedro Coelho, Arlindo L. Oliveira |
Dotted Suffix Trees A Structure for Approximate Text Indexing. |
SPIRE |
2006 |
DBLP DOI BibTeX RDF |
approximate text matching, suffix trees, text indexing, string algorithms |
18 | Emmanouil M. Voumvoulakis, Nikos D. Hatziargyriou |
Dynamic Security Assessment and Load Shedding Schemes Using Self Organized Maps and Decision Trees. |
SETN |
2006 |
DBLP DOI BibTeX RDF |
Dynamic Security, Decision Trees, Self Organizing Maps, Load shedding |
18 | Sinisa Todorovic, Michael C. Nechyba |
Dynamic Trees for Unsupervised Segmentation and Matching of Image Regions. |
IEEE Trans. Pattern Anal. Mach. Intell. |
2005 |
DBLP DOI BibTeX RDF |
dynamic trees, image segmentation, object recognition, Bayesian networks, image matching, Generative models, variational inference |
18 | I-Jen Chiang, Ming-Jium Shieh, Jane Yung-jen Hsu, Jau-Min Wong |
Building a Medical Decision Support System for Colon Polyp Screening by Using Fuzzy Classification Trees. |
Appl. Intell. |
2005 |
DBLP DOI BibTeX RDF |
polyp screening, fuzzy classification trees, fuzzy classifications, fuzzy entropy |
18 | Paraskevi Fragopoulou, Stavros D. Nikolopoulos, Leonidas Palios |
Multi-source Trees: Algorithms for Minimizing Eccentricity Cost Metrics. |
ISAAC |
2005 |
DBLP DOI BibTeX RDF |
Multi-source trees, algorithms, communication, complexity, networks, weighted graphs, eccentricity |
18 | Liana Stanescu, Dumitru Dan Burdescu, Cosmin Stoica Spahiu |
Using R-Trees in Content-Based Region Query with Spatial Bounds. |
SYNASC |
2005 |
DBLP DOI BibTeX RDF |
content-based region query, spatial bounds, absolute localization, minimal bounding rectangle, R trees, spatial indexing |
18 | Willem Visser, Corina S. Pasareanu, Radek Pelánek |
Test input generation for red-black trees using abstraction. |
ASE |
2005 |
DBLP DOI BibTeX RDF |
testing object oriented programs, model checking, abstraction, coverage, red-black trees |
18 | Michael Elkin, Yuval Emek, Daniel A. Spielman, Shang-Hua Teng |
Lower-stretch spanning trees. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
low-distortion embeddings, low-stretch spanning trees, probabilistic tree metrics |
18 | Sonia Estévez Martín, Rafael del Vado Vírseda |
Designing an efficient computation strategy in CFLP(FD) using definitional trees. |
WCFLP |
2005 |
DBLP DOI BibTeX RDF |
definitional trees, functional logic languages, constraint logic programming, narrowing, finite domains |
18 | B. S. Panda 0001, Anita Das 0001 |
A Linear Time Algorithm for Constructing Tree 4-Spanner in 2-Trees. |
CIT |
2004 |
DBLP DOI BibTeX RDF |
Tree Spanner, Distance in Graphs, 2-trees, Graph Algorithms |
18 | Fredy Rivera, Marcos Sánchez-Élez, Milagros Fernández, Román Hermida, Nader Bagherzadeh |
Efficient mapping of hierarchical trees on coarse-grain reconfigurable architectures. |
CODES+ISSS |
2004 |
DBLP DOI BibTeX RDF |
multimedia, computer graphics, reconfigurable architectures, SIMD, hierarchical trees |
18 | Luis Hernández-Martínez, Arturo Sarmiento-Reyes |
Topological Considerations for the Diagnosability Conditions of Analogue Circuits Using a Pair of Conjugate Trees. |
J. Electron. Test. |
2003 |
DBLP DOI BibTeX RDF |
analogue circuit diagnostic, topological conditions, pair of conjugate trees |
18 | Alain Colmerauer, Thi-Bich-Hanh Dao |
Expressiveness of Full First-Order Constraints in the Algebra of Finite or Infinite Trees. |
Constraints An Int. J. |
2003 |
DBLP DOI BibTeX RDF |
complexity, constraints, trees, first order logic, expressiveness |
18 | Chaomei Chen, Steven A. Morris |
Visualizing Evolving Networks: Minimum Spanning Trees versus Pathfinder Networks. |
INFOVIS |
2003 |
DBLP DOI BibTeX RDF |
co-citation networks, Pathfinder networks, minimum spanning trees, network visualization, Network evolution |
18 | Bharat Krishna, C. Y. Roger Chen, Naresh Sehgal |
A novel ultra-fast heuristic for VLSI CAD steiner trees. |
ACM Great Lakes Symposium on VLSI |
2003 |
DBLP DOI BibTeX RDF |
routing, steiner trees, interconnect estimation |
18 | Chris Coulston |
Constructing exact octagonal steiner minimal trees. |
ACM Great Lakes Symposium on VLSI |
2003 |
DBLP DOI BibTeX RDF |
octagonal, routing, computer-aided design, steiner trees |
18 | Victor Chepoi, Yann Vaxès |
Augmenting Trees to Meet Biconnectivity and Diameter Constraints. |
Algorithmica |
2002 |
DBLP DOI BibTeX RDF |
Biconnectivity augmentation, Approximation algorithms, Trees, Diameter, Radius |
18 | Eugene Inseok Chong, Jagannathan Srinivasan, Souripriya Das, Chuck Freiwald, Aravind Yalamanchi, Mahesh Jagannath, Anh-Tuan Tran 0005, Ramkumar Krishnan, Richard Jiang 0002 |
A mapping mechanism to support bitmap index and other auxiliary structures on tables stored as primary B±trees. |
CIKM |
2002 |
DBLP DOI BibTeX RDF |
mapping mechanism, primary B+-trees, bitmap indexes |
18 | Yufei Tao 0001, Dimitris Papadias, Jun Zhang 0005 |
Cost Models for Overlapping and Multi-Version B-Trees. |
ICDE |
2002 |
DBLP DOI BibTeX RDF |
Cost Modes, Multi-Version B-trees, Overlapping |
|
|