Sciweavers

680 search results - page 53 / 136
» A randomized embedding algorithm for trees
Sort
View
AIMSA
2008
Springer
14 years 3 months ago
Incorporating Learning in Grid-Based Randomized SAT Solving
Abstract. Computational Grids provide a widely distributed computing environment suitable for randomized SAT solving. This paper develops techniques for incorporating learning, kno...
Antti Eero Johannes Hyvärinen, Tommi A. Juntt...
ICPR
2008
IEEE
14 years 10 months ago
Image objects and multi-scale features for annotation detection
This paper investigates several issues in the problem of detecting handwritten markings, or annotations, on printed documents. One issue is to define the appropriate units over wh...
Eric Saund, Jindong Chen, Yizhou Wang
ESA
2003
Springer
93views Algorithms» more  ESA 2003»
14 years 2 months ago
Improved Bounds for Finger Search on a RAM
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...
Alexis C. Kaporis, Christos Makris, Spyros Sioutas...
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
14 years 3 months ago
Some novel locality results for the blob code spanning tree representation
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
Tim Paulden, David K. Smith
ICCV
2009
IEEE
15 years 1 months ago
Semi-Supervised Random Forests
Random Forests (RFs) have become commonplace in many computer vision applications. Their popularity is mainly driven by their high computational efficiency during both training ...
Christian Leistner, Amir Saffari, Jakob Santner, H...