Sciweavers

2600 search results - page 80 / 520
» Clustering with or without the Approximation
Sort
View
ICALP
2009
Springer
15 years 10 months ago
Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
Nir Ailon, Edo Liberty
CIVR
2006
Springer
126views Image Analysis» more  CIVR 2006»
15 years 1 months ago
Semantics Supervised Cluster-Based Index for Video Databases
High-dimensional index is one of the most challenging tasks for content-based video retrieval (CBVR). Typically, in video database, there exist two kinds of clues for query: visual...
Zhiping Shi, Qingyong Li, Zhiwei Shi, Zhongzhi Shi
ICPR
2000
IEEE
15 years 11 months ago
OCR with No Shape Training
We present a document-specific OCR system and apply it to a corpus of faxed business letters. Unsupervised classification of the segmented character bitmaps on each page, using a ...
Tin Kam Ho, George Nagy
ICML
2008
IEEE
15 years 10 months ago
ManifoldBoost: stagewise function approximation for fully-, semi- and un-supervised learning
We introduce a boosting framework to solve a classification problem with added manifold and ambient regularization costs. It allows for a natural extension of boosting into both s...
Nicolas Loeff, David A. Forsyth, Deepak Ramachandr...
CGF
2008
128views more  CGF 2008»
14 years 10 months ago
Hierarchical Convex Approximation of 3D Shapes for Fast Region Selection
Given a 3D solid model S represented by a tetrahedral mesh, we describe a novel algorithm to compute a hierarchy of convex polyhedra that tightly enclose S. The hierarchy can be b...
Marco Attene, Michela Mortara, Michela Spagnuolo, ...