Sciweavers

668 search results - page 78 / 134
» Algorithmics and Applications of Tree and Graph Searching
Sort
View
AAAI
2011
14 years 4 months ago
Stopping Rules for Randomized Greedy Triangulation Schemes
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
Andrew Gelfand, Kalev Kask, Rina Dechter
COMPGEOM
2004
ACM
15 years 10 months ago
Deformable spanners and applications
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
Jie Gao, Leonidas J. Guibas, An Nguyen
AVI
2004
15 years 6 months ago
Interactive data summarization: an example application
Summarizing large multidimensional datasets is a challenging task, often requiring extensive investigation by a user to identify overall trends and important exceptions to them. W...
Neal Lesh, Michael Mitzenmacher
112
Voted
BIRD
2007
Springer
128views Bioinformatics» more  BIRD 2007»
15 years 10 months ago
Efficient and Scalable Indexing Techniques for Biological Sequence Data
We investigate indexing techniques for sequence data, crucial in a wide variety of applications, where efficient, scalable, and versatile search algorithms are required. Recent res...
Mihail Halachev, Nematollaah Shiri, Anand Thamildu...
AI
2011
Springer
14 years 11 months ago
State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
Daniel Bryce, William Cushing, Subbarao Kambhampat...