|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 488 occurrences of 367 keywords
|
|
|
Results
Found 768 publication records. Showing 768 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
10 | Geoff Hulten, Laurie Spencer, Pedro M. Domingos |
Mining time-changing data streams. |
KDD |
2001 |
DBLP DOI BibTeX RDF |
Decision trees, data streams, incremental learning, concept drift, subsampling, Hoeffding bounds |
10 | Sabine Cornelsen, Yefim Dinitz, Dorothea Wagner |
Planarity of the 2-Level Cactus Model. |
WG |
2001 |
DBLP DOI BibTeX RDF |
|
10 | Maw-Shang Chang, Haiko Müller |
On the Tree-Degree of Graphs. |
WG |
2001 |
DBLP DOI BibTeX RDF |
|
10 | Li-Minn Ang, Hon Nin Cheung |
Hardware implementation of the depth first search bit stream SPIHT system. |
ISCAS (4) |
2001 |
DBLP DOI BibTeX RDF |
|
10 | Tal Pupko, Roded Sharan, Masami Hasegawa, Ron Shamir, Dan Graur |
A Chemical-Distance-Based Test for Positive Darwinian Selection. |
WABI |
2001 |
DBLP DOI BibTeX RDF |
|
10 | Trong Dung Nguyen, Tu Bao Ho, Hiroshi Shimodaira |
A Scalable Algorithm for Rule Post-pruning of Large Decision Trees. |
PAKDD |
2001 |
DBLP DOI BibTeX RDF |
|
10 | Marcello Pelillo |
Matching Free Trees, Maximal Cliques, and Monotone Game Dynamics. |
EMMCVPR |
2001 |
DBLP DOI BibTeX RDF |
|
10 | William B. Langdon, Wolfgang Banzhaf |
Genetic Programming Bloat without Semantics. |
PPSN |
2000 |
DBLP DOI BibTeX RDF |
|
10 | Ali Shokoufandeh, Sven J. Dickinson |
Graph-Theoretical Methods in Computer Vision. |
Theoretical Aspects of Computer Science |
2000 |
DBLP DOI BibTeX RDF |
|
10 | Hajime Kitakami, Mitsuko Nishimoto |
Constraint Satisfaction for Reconciling Heterogeneous Tree Databases. |
DEXA |
2000 |
DBLP DOI BibTeX RDF |
|
10 | Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting |
A Faster and Unifying Algorithm for Comparing Trees. |
CPM |
2000 |
DBLP DOI BibTeX RDF |
|
10 | David Bryant |
Optimal Agreement Supertrees. |
JOBIM |
2000 |
DBLP DOI BibTeX RDF |
|
10 | Massimo Bartoli, Marcello Pelillo, Kaleem Siddiqi, Steven W. Zucker |
Attributed Tree Homomorphism Using Association Graphs. |
ICPR |
2000 |
DBLP DOI BibTeX RDF |
|
10 | Daniel Král, Jan Kratochvíl, Andrzej Proskurowski, Heinz-Jürgen Voss |
Coloring Mixed Hypertrees. |
WG |
2000 |
DBLP DOI BibTeX RDF |
|
10 | Goran Konjevod, Sven Oliver Krumke, Madhav V. Marathe |
Budget Constrained Minimum Cost Connected Medians. |
WG |
2000 |
DBLP DOI BibTeX RDF |
|
10 | Ulf Lorenz |
Controlled Conspiracy-2 Search. |
STACS |
2000 |
DBLP DOI BibTeX RDF |
algorithms and datastructures |
10 | María A. Trenas, Juan López, Emilio L. Zapata |
FPGA Implementation of Wavelet Packet Transform with Reconfigurable Tree Structure. |
EUROMICRO |
2000 |
DBLP DOI BibTeX RDF |
|
10 | Cyrus Shahabi, Xiaoming Tian, Wugang Zhao |
TSA-Tree: A Wavelet-Based Approach to Improve the Efficiency of Multi-Level Surprise and Trend Queries on Time-Series Data. |
SSDBM |
2000 |
DBLP DOI BibTeX RDF |
trend mining, surprise mining, data mining, wavelet, time series, outlier |
10 | Monika Rauch Henzinger, Valerie King, Tandy J. Warnow |
Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology. |
Algorithmica |
1999 |
DBLP DOI BibTeX RDF |
Evolutionary biology, Theory of databases, Algorithms, Data structures |
10 | Chin-Chih Chang, Jason Cong |
An efficient approach to multilayer layer assignment with anapplication to via minimization. |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. |
1999 |
DBLP DOI BibTeX RDF |
|
10 | Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting |
A Decomposition Theorem for Maximum Weight Bipartite Matchings with Applications to Evolutionary Trees. |
ESA |
1999 |
DBLP DOI BibTeX RDF |
|
10 | Eduardo Sany Laber, Ruy Luiz Milidiú, Artur Alves Pessoa |
Strategies for Searching with Different Access Costs. |
ESA |
1999 |
DBLP DOI BibTeX RDF |
|
10 | Robert Giegerich, Stefan Kurtz, Jens Stoye |
Efficient Implementation of Lazy Suffix Trees. |
WAE |
1999 |
DBLP DOI BibTeX RDF |
|
10 | Douglas A. Talbert, Douglas H. Fisher |
Exploiting Sample-Data Distributions to Reduce the Cost of Nearest-Neighbor Searches with Kd-Trees. |
IDA |
1999 |
DBLP DOI BibTeX RDF |
|
10 | Ming-Yang Kao, Andrzej Lingas, Anna Östlin |
Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions. |
STACS |
1999 |
DBLP DOI BibTeX RDF |
|
10 | Mark Sifer, Olivier Liechti |
Zooming in One Dimension Can Be Better Than Two: An Interface for Placing Search Results in Context with a Restricted Sitemap. |
VL |
1999 |
DBLP DOI BibTeX RDF |
WWW, search, sitemap, zooming interface |
10 | Geoffrey M. Davis |
A wavelet-based analysis of fractal image compression. |
IEEE Trans. Image Process. |
1998 |
DBLP DOI BibTeX RDF |
|
10 | Michael R. Fellows, Michael T. Hallett, Chantal Korostensky, Ulrike Stege |
Analogs and Duals of the MAST Problem for Sequences and Trees. |
ESA |
1998 |
DBLP DOI BibTeX RDF |
|
10 | Sándor P. Fekete, Jana Kremer |
Tree Spanners in Planar Graphs. |
WG |
1998 |
DBLP DOI BibTeX RDF |
|
10 | Marcello Pelillo, Kaleem Siddiqi, Steven W. Zucker |
Matching Hierarchical Structures Using Association Graphs. |
ECCV (2) |
1998 |
DBLP DOI BibTeX RDF |
|
10 | Francesco Ricci 0001, Luca Senter |
Structured Cases, Trees and Efficient Retrieval. |
EWCBR |
1998 |
DBLP DOI BibTeX RDF |
|
10 | Shiuh-Pyng Shieh, Fu-Shen Ho |
A Comment on "A Total Ordering Multicast Protocol Using Propagation Trees". |
IEEE Trans. Parallel Distributed Syst. |
1997 |
DBLP DOI BibTeX RDF |
distributed systems, group communication, process synchronization, Multicast protocols, message ordering |
10 | J. Ian Munro, Venkatesh Raman 0001 |
Succinct Representation of Balanced Parentheses, Static Trees and Planar Graphs. |
FOCS |
1997 |
DBLP DOI BibTeX RDF |
balanced parentheses, static trees, rooted ordered tree, planar graphs, abstract data types, abstract data types, binary tree, adjacency, succinct representation |
10 | Nicolas Prcovic |
Changing the Distribution Depth During a Parallel Tree Search. |
Euro-Par |
1997 |
DBLP DOI BibTeX RDF |
|
10 | Evguenii I. Goldberg, Luca P. Carloni, Tiziano Villa, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli |
Negative thinking by incremental problem solving: application to unate covering. |
ICCAD |
1997 |
DBLP DOI BibTeX RDF |
negative thinking, discrete optimization, covering problem |
10 | Jacob Feldman |
Efficient Regularity-Based Grouping. |
CVPR |
1997 |
DBLP DOI BibTeX RDF |
Segmentation and grouping, human and machine vision |
10 | Jason Cong, Lei He 0001 |
Optimal wiresizing for interconnects with multiple sources. |
ACM Trans. Design Autom. Electr. Syst. |
1996 |
DBLP DOI BibTeX RDF |
bundled refinement, decomposition of multi-source routing tree, dominance property, multi-source net, multi-source routing tree, optimal wiresizing, variable segment-division, high performance, SPICE, fidelity, interconnect optimization, Elmore delay, local refinement, layout optimization |
10 | Alan Carle, Lori L. Pollock |
On the Optimality of Change Propagation for Incremental Evaluation of Hierarchical Attribute Grammars. |
ACM Trans. Program. Lang. Syst. |
1996 |
DBLP DOI BibTeX RDF |
optimality, attribute grammar, change propagation, incremental evaluation |
10 | Magnús M. Halldórsson, Keisuke Tanaka |
Approximation and Special Cases of Common Subtrees and Editing Distance. |
ISAAC |
1996 |
DBLP DOI BibTeX RDF |
|
10 | Pierluigi Crescenzi, Paolo Penna |
Upward Drawings of Search Trees (Extended Abstract). |
WG |
1996 |
DBLP DOI BibTeX RDF |
|
10 | Yair I. Friedman, Dror G. Feitelson, Iaakov Exman |
The Parallel Break Construct, or How to Kill an Activity Tree. |
IPPS |
1996 |
DBLP DOI BibTeX RDF |
parallel constructs, forced termination, kill, abort, ParC, break |
10 | V. Michele Abrusci, Christophe Fouqueré, Jacqueline Vauzeilles |
Tree Adjoining Grammars in Noncommutative Linear Logic. |
LACL |
1996 |
DBLP DOI BibTeX RDF |
|
10 | Qiming Chen, Umeshwar Dayal |
Commit Scope Control in Nested Transactions. |
EDBT |
1996 |
DBLP DOI BibTeX RDF |
|
10 | James Jianghai Fu |
Linear matching-time algorithm for the directed graph isomorphism problem. |
ISAAC |
1995 |
DBLP DOI BibTeX RDF |
|
10 | Arvind Gupta, Naomi Nishimura |
finding Smallest Supertrees. |
ISAAC |
1995 |
DBLP DOI BibTeX RDF |
|
10 | Martin Farach, Teresa M. Przytycka, Mikkel Thorup |
Computing the Agreement of Trees with Bounded Degrees. |
ESA |
1995 |
DBLP DOI BibTeX RDF |
|
10 | Dekang Lin |
University of Manitoba: description of the PIE system used for MUC-6. |
MUC |
1995 |
DBLP DOI BibTeX RDF |
|
10 | Peter Damaschke |
Searching for Faulty Leaves in Binary Trees. |
WG |
1995 |
DBLP DOI BibTeX RDF |
|
10 | Jason Cong, Lei He 0001 |
Optimal wiresizing for interconnects with multiple sources. |
ICCAD |
1995 |
DBLP DOI BibTeX RDF |
performance driven layout, optimal wiresizing, interconnect optimization, VLSI routing |
10 | Miroslav Kubat, Doris Flotzinger |
Pruning Multivariate Decision Trees by Hyperplane Merging. |
ECML |
1995 |
DBLP DOI BibTeX RDF |
|
10 | Gail E. Kaiser, Simon M. Kaplan |
Parallel and Distributed Incremental Attribute Evaluation Algorithms for Multiuser Software Development Environments. |
ACM Trans. Softw. Eng. Methodol. |
1993 |
DBLP DOI BibTeX RDF |
reliability, parallel, distributed, attribute grammar, incremental algorithm, change propagation |
10 | Andreas Goerdt, Udo Kamps |
On the Reasons for Average Superlinear Speedup in Parallel Backtrack Search. |
CSL |
1993 |
DBLP DOI BibTeX RDF |
|
10 | Fabrizio Baiardi, D. M. Bella |
An Architectural Model for OR-Parallelism on Distributed Memory Systems. |
PLILP |
1991 |
DBLP DOI BibTeX RDF |
|
10 | Harald Vogt, S. Doaitse Swierstra, Matthijs F. Kuiper |
Efficient Incremental Evaluation of Higher order Attribute Grammars. |
PLILP |
1991 |
DBLP DOI BibTeX RDF |
|
10 | James Haralambides, Fillia Makedon |
Approximation Algorithms for the Bandwidth Minimization Problem for a Large Class of Trees. |
ICCI |
1991 |
DBLP DOI BibTeX RDF |
|
10 | Donna J. Williams, Mubarak Shah |
Edge Contours Using Multiple Scales. |
ECCV |
1990 |
DBLP DOI BibTeX RDF |
|
10 | Robert Hieb, R. Kent Dybvig |
Continuations and Concurrency. |
PPoPP |
1990 |
DBLP DOI BibTeX RDF |
SCHEME |
10 | Uschi Heuter |
Generalized Definite Tree Languages. |
MFCS |
1989 |
DBLP DOI BibTeX RDF |
|
10 | Sanjai Narain |
Optimization by Non-Deterministic, Lazy Rewriting. |
RTA |
1989 |
DBLP DOI BibTeX RDF |
|
10 | Dashing Yeh, Uwe Kastens |
Improvements of an incremental evaluation algorithm for ordered attribute grammars. |
ACM SIGPLAN Notices |
1988 |
DBLP DOI BibTeX RDF |
|
10 | Jan van den Bos |
Abstract Interaction Tools: A Language for User Interface Management Systems. |
ACM Trans. Program. Lang. Syst. |
1988 |
DBLP DOI BibTeX RDF |
|
10 | Roger Hoover |
Dynamically Bypassing Copy Rule Chains in Attribute Grammars. |
POPL |
1986 |
DBLP DOI BibTeX RDF |
|
10 | Don Morrison |
Maps and descendant husband trees (abstract only). |
ACM Conference on Computer Science |
1985 |
DBLP DOI BibTeX RDF |
|
10 | Thomas W. Reps |
Optimal-Time Incremental Semantic Analysis for Syntax-Directed Editors. |
POPL |
1982 |
DBLP DOI BibTeX RDF |
|
10 | Yehoshua Perl, Yossi Shiloach |
Efficient Optimization of Monotonic Functions on Trees. |
CAAP |
1981 |
DBLP DOI BibTeX RDF |
|
10 | Rina S. Cohen, E. Harry |
Automatic Generation of Near-Optimal Translators for Noncircular Attribute Grammars. |
POPL |
1979 |
DBLP DOI BibTeX RDF |
|
10 | Barry K. Rosen |
Tree-Manipulating Systems and Church-Rosser Theorems. |
J. ACM |
1973 |
DBLP DOI BibTeX RDF |
|
10 | Joyce Friedman |
Directed random generation of sentences. |
Commun. ACM |
1969 |
DBLP DOI BibTeX RDF |
natural language syntax, sentence generation, computational linguistics, syntax, language processing, transformational grammar |
Displaying result #701 - #768 of 768 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8] |
|