Sciweavers

310 search results - page 53 / 62
» Randomized Binary Search Trees
Sort
View
ICDAR
2009
IEEE
13 years 7 months ago
Recognition of Handwritten Numerical Fields in a Large Single-Writer Historical Collection
This paper presents a segmentation-based handwriting recognizer and the performance that it achieves on the numerical fields extracted from a large single-writer historical collec...
Marius Bulacu, Axel Brink, Tijn van der Zant, Lamb...
TOG
2002
133views more  TOG 2002»
13 years 9 months ago
Interactive motion generation from examples
There are many applications that demand large quantities of natural looking motion. It is difficult to synthesize motion that looks natural, particularly when it is people who mus...
Okan Arikan, David A. Forsyth
ALGORITHMICA
1998
73views more  ALGORITHMICA 1998»
13 years 9 months ago
Linear Probing and Graphs
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
Donald E. Knuth
ECCV
2008
Springer
14 years 11 months ago
Simultaneous Detection and Registration for Ileo-Cecal Valve Detection in 3D CT Colonography
Object detection and recognition has achieved a significant progress in recent years. However robust 3D object detection and segmentation in noisy 3D data volumes remains a challen...
Le Lu, Adrian Barbu, Matthias Wolf, Jianming Liang...
NLP
2000
14 years 1 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman