Sciweavers

807 search results - page 24 / 162
» Space Efficient Algorithms for Ordered Tree Comparison
Sort
View
CGF
2006
107views more  CGF 2006»
15 years 4 months ago
Volume-Surface Trees
Many algorithms in computer graphics improve their efficiency by using Hierarchical Space Subdivision Schemes (HS3), such as octrees, kD-trees or BSP trees. Such HS3 usually provi...
Tamy Boubekeur, Wolfgang Heidrich, Xavier Granier,...
ECCV
2002
Springer
16 years 6 months ago
A Comparison of Search Strategies for Geometric Branch and Bound Algorithms
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
Thomas M. Breuel
ICML
2004
IEEE
16 years 5 months ago
Training conditional random fields via gradient tree boosting
Conditional Random Fields (CRFs; Lafferty, McCallum, & Pereira, 2001) provide a flexible and powerful model for learning to assign labels to elements of sequences in such appl...
Thomas G. Dietterich, Adam Ashenfelter, Yaroslav B...
ICCAD
2010
IEEE
186views Hardware» more  ICCAD 2010»
15 years 2 months ago
Efficient state space exploration: Interleaving stateless and state-based model checking
State-based model checking methods comprise computing and storing reachable states, while stateless model checking methods directly reason about reachable paths using decision proc...
Malay K. Ganai, Chao Wang, Weihong Li
SIGMOD
1998
ACM
93views Database» more  SIGMOD 1998»
15 years 8 months ago
Efficiently Mining Long Patterns from Databases
We present a pattern-mining algorithm that scales roughly linearly in the number of maximal patterns embedded in a database irrespective of the length of the longest pattern. In c...
Roberto J. Bayardo Jr.