Sciweavers

807 search results - page 84 / 162
» Space Efficient Algorithms for Ordered Tree Comparison
Sort
View
MICCAI
2009
Springer
16 years 4 months ago
Accelerating Feature Based Registration Using the Johnson-Lindenstrauss Lemma
We introduce an efficient search strategy to substantially accelerate feature based registration. Previous feature based registration algorithms often use truncated search strategi...
Ayelet Akselrod-Ballin, Davi Bock, R. Clay Reid,...
AI
2002
Springer
15 years 3 months ago
Parallel Randomized Best-First Minimax Search
We describe a novel parallel randomized search algorithm for two-player games. The algorithm is a randomized version of Korf and Chickering's best-first search. Randomization...
Yaron Shoham, Sivan Toledo
CONSTRAINTS
2010
101views more  CONSTRAINTS 2010»
15 years 3 months ago
Evaluating the impact of AND/OR search on 0-1 integer linear programming
AND/OR search spaces accommodate advanced algorithmic schemes for graphical models which can exploit the structure of the model. We extend and evaluate the depth-first and best-fi...
Radu Marinescu 0002, Rina Dechter
141
Voted
EDBT
2009
ACM
138views Database» more  EDBT 2009»
15 years 10 months ago
FOGGER: an algorithm for graph generator discovery
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
Zhiping Zeng, Jianyong Wang, Jun Zhang, Lizhu Zhou
144
Voted
JACM
2007
160views more  JACM 2007»
15 years 3 months ago
Lossless abstraction of imperfect information games
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
Andrew Gilpin, Tuomas Sandholm