Sciweavers

7015 search results - page 206 / 1403
» Approximation algorithms for co-clustering
Sort
View
ICDAR
2009
IEEE
15 years 4 months ago
Bayesian Similarity Model Estimation for Approximate Recognized Text Search
Approximate text search is a basic technique to handle recognized text that contains recognition errors. This paper proposes an approximate string search for recognized text using...
Atsuhiro Takasu
COMPGEOM
2001
ACM
15 years 10 months ago
A practical approach for computing the diameter of a point set
We present an approximation algorithm for computing the diameter of a point-set in d-dimensions. The new algorithm is sensitive to the "hardness" of computing the diamet...
Sariel Har-Peled
SODA
2003
ACM
121views Algorithms» more  SODA 2003»
15 years 7 months ago
Improved results for directed multicut
We give a simple algorithm for the MINIMUM DIRECTED MULTICUT problem, and show that it gives an Ç´ÔÒµapproximation. This improves on the previous approximation guarantee of ...
Anupam Gupta
ICCV
2011
IEEE
14 years 6 months ago
A Graph-matching Kernel for Object Categorization
This paper addresses the problem of category-level image classification. The underlying image model is a graph whose nodes correspond to a dense set of regions, and edges reflec...
Olivier Duchenne, Armand Joulin, Jean Ponce
PAMI
2012
13 years 9 months ago
Image Signature: Highlighting Sparse Salient Regions
—We introduce a simple image descriptor referred to as the image signature. We show, within the theoretical framework of sparse signal mixing, that this quantity spatially approx...
Xiaodi Hou, Jonathan Harel, Christof Koch