Sciweavers

2434 search results - page 225 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
CVPR
2005
IEEE
16 years 6 months ago
Matching with PROSAC - Progressive Sample Consensus
A new robust matching method is proposed. The Progressive Sample Consensus (PROSAC) algorithm exploits the linear ordering defined on the set of correspondences by a similarity fu...
Ondrej Chum, Jiri Matas
KDD
2005
ACM
137views Data Mining» more  KDD 2005»
16 years 4 months ago
Pattern-based similarity search for microarray data
One fundamental task in near-neighbor search as well as other similarity matching efforts is to find a distance function that can efficiently quantify the similarity between two o...
Haixun Wang, Jian Pei, Philip S. Yu
CVPR
2010
IEEE
16 years 9 days ago
On Growth and Formlets: Sparse Multi-Scale Coding of Planar Shape
This paper presents a sparse representation of 2D planar shape through the composition of warping functions, termed formlets, localized in scale and space. Each formlet subjects t...
Timothy Oleskiw, James Elder, Gabriel Peyr
LPNMR
2009
Springer
15 years 11 months ago
The Complexity of Circumscriptive Inference in Post's Lattice
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...
Michael Thomas
WWW
2009
ACM
16 years 5 months ago
Graffiti: node labeling in heterogeneous networks
We introduce a multi-label classification model and algorithm for labeling heterogeneous networks, where nodes belong to different types and different types have different sets of...
Ralitsa Angelova, Gjergji Kasneci, Fabian M. Sucha...