Sciweavers

136 search results - page 5 / 28
» A Spectral Technique for Correspondence Problems Using Pairw...
Sort
View
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
14 years 3 months ago
Optimal Sherali-Adams Gaps from Pairwise Independence
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
Konstantinos Georgiou, Avner Magen, Madhur Tulsian...
BMCBI
2011
13 years 3 months ago
Screening synteny blocks in pairwise genome comparisons through integer programming
Background: It is difficult to accurately interpret chromosomal correspondences such as true orthology and paralogy due to significant divergence of genomes from a common ancestor...
Haibao Tang, Eric Lyons, Brent S. Pedersen, James ...
SIGIR
2011
ACM
12 years 11 months ago
No free lunch: brute force vs. locality-sensitive hashing for cross-lingual pairwise similarity
This work explores the problem of cross-lingual pairwise similarity, where the task is to extract similar pairs of documents across two different languages. Solutions to this pro...
Ferhan Ture, Tamer Elsayed, Jimmy J. Lin
ICRA
2008
IEEE
129views Robotics» more  ICRA 2008»
14 years 3 months ago
Incremental spectral clustering and seasons: Appearance-based localization in outdoor environments
— The problem of appearance-based mapping and navigation in outdoor environments is far from trivial. In this paper, an appearance-based topological map, covering a large, mixed ...
Christoffer Valgren, Achim J. Lilienthal
CVPR
2006
IEEE
14 years 10 months ago
Unsupervised Learning of Categories from Sets of Partially Matching Image Features
We present a method to automatically learn object categories from unlabeled images. Each image is represented by an unordered set of local features, and all sets are embedded into...
Kristen Grauman, Trevor Darrell