Sciweavers

172 search results - page 21 / 35
» Approximate low-rank factorization with structured factors
Sort
View
ICDAR
2011
IEEE
12 years 8 months ago
Symbol Spotting in Line Drawings through Graph Paths Hashing
—In this paper we propose a symbol spotting technique through hashing the shape descriptors of graph paths (Hamiltonian paths). Complex graphical structures in line drawings can ...
Anjan Dutta, Josep Lladós, Umapada Pal
CDC
2009
IEEE
123views Control Systems» more  CDC 2009»
14 years 1 months ago
On the myopic policy for a class of restless bandit problems with applications in dynamic multichannel access
We consider a class of restless multi-armed bandit problems that arises in multi-channel opportunistic communications, where channels are modeled as independent and stochastically...
Keqin Liu, Qing Zhao
IJCV
2006
115views more  IJCV 2006»
13 years 8 months ago
An Analysis of Linear Subspace Approaches for Computer Vision and Pattern Recognition
: Linear subspace analysis (LSA) has become rather ubiquitous in a wide range of problems arising in pattern recognition and computer vision. The essence of these approaches is tha...
Pei Chen, David Suter
SODA
2000
ACM
127views Algorithms» more  SODA 2000»
13 years 10 months ago
Dimensionality reduction techniques for proximity problems
In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 + )-neares...
Piotr Indyk
BMCBI
2007
134views more  BMCBI 2007»
13 years 8 months ago
Efficient pairwise RNA structure prediction using probabilistic alignment constraints in Dynalign
Background: Joint alignment and secondary structure prediction of two RNA sequences can significantly improve the accuracy of the structural predictions. Methods addressing this p...
Arif Ozgun Harmanci, Gaurav Sharma, David H. Mathe...