Sciweavers

421 search results - page 76 / 85
» String Distances and Uniformities
Sort
View
ICDAR
2011
IEEE
12 years 8 months ago
Fast Key-Word Searching via Embedding and Active-DTW
—In this paper we present a novel approach for fast search of handwritten Arabic word-parts within large lexicons. The algorithm runs through three steps to achieve the required ...
Raid Saabni, Alex Bronstein
JMLR
2012
11 years 11 months ago
High-Rank Matrix Completion
This paper considers the problem of completing a matrix with many missing entries under the assumption that the columns of the matrix belong to a union of multiple low-rank subspa...
Brian Eriksson, Laura Balzano, Robert Nowak
PODC
2004
ACM
14 years 1 months ago
Analyzing Kleinberg's (and other) small-world Models
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
Charles U. Martel, Van Nguyen
CVPR
2009
IEEE
15 years 3 months ago
Constrained Marginal Space Learning for Efficient 3D Anatomical Structure Detection in Medical Images
Recently, we proposed marginal space learning (MSL) as a generic approach for automatic detection of 3D anatom- ical structures in many medical imaging modalities. To accurately...
Yefeng Zheng, Bogdan Georgescu, Haibin Ling, Shaoh...
STOC
2009
ACM
136views Algorithms» more  STOC 2009»
14 years 9 months ago
Random walks on polytopes and an affine interior point method for linear programming
Let K be a polytope in Rn defined by m linear inequalities. We give a new Markov Chain algorithm to draw a nearly uniform sample from K. The underlying Markov Chain is the first t...
Ravi Kannan, Hariharan Narayanan