Sciweavers

219 search results - page 39 / 44
» Fast Algorithms for Finding Extremal Sets
Sort
View
BMCBI
2005
109views more  BMCBI 2005»
13 years 7 months ago
Genome comparison without alignment using shortest unique substrings
Background: Sequence comparison by alignment is a fundamental tool of molecular biology. In this paper we show how a number of sequence comparison tasks, including the detection o...
Bernhard Haubold, Nora Pierstorff, Friedrich M&oum...
PVLDB
2008
154views more  PVLDB 2008»
13 years 7 months ago
Indexing land surface for efficient kNN query
The class of k Nearest Neighbor (kNN) queries is frequently used in geospatial applications. Many studies focus on processing kNN in Euclidean and road network spaces. Meanwhile, ...
Cyrus Shahabi, Lu-An Tang, Songhua Xing
CVPR
2005
IEEE
14 years 9 months ago
Shape Matching and Object Recognition Using Low Distortion Correspondences
We approach recognition in the framework of deformable shape matching, relying on a new algorithm for finding correspondences between feature points. This algorithm sets up corres...
Alexander C. Berg, Tamara L. Berg, Jitendra Malik
KDD
2004
ACM
139views Data Mining» more  KDD 2004»
14 years 8 months ago
Machine learning for online query relaxation
In this paper we provide a fast, data-driven solution to the failing query problem: given a query that returns an empty answer, how can one relax the query's constraints so t...
Ion Muslea
ICCV
2009
IEEE
15 years 16 days ago
3D reconstruction from image collections with a single known focal length
In this paper we aim at reconstructing 3D scenes from images with unknown focal lengths downloaded from photosharing websites such as Flickr. First we provide a minimal solution...
Martin Bujnak, Zuzana Kukelova, Tomas Pajdla