Sciweavers

1871 search results - page 209 / 375
» The Ephemeral Pairing Problem
Sort
View
ICCV
2005
IEEE
16 years 8 months ago
Vehicle Identification between Non-Overlapping Cameras without Direct Feature Matching
We propose a novel method for identifying road vehicles between two non-overlapping cameras. The problem is formulated as a same-different classification problem: probability of t...
Ying Shan, Harpreet S. Sawhney, Rakesh Kumar
ECCV
2004
Springer
16 years 8 months ago
Stereo Using Monocular Cues within the Tensor Voting Framework
We address the fundamental problem of matching in two static images. The remaining challenges are related to occlusion and lack of texture. Our approach addresses these difficultie...
Philippos Mordohai, Gérard G. Medioni
ICDE
2006
IEEE
156views Database» more  ICDE 2006»
16 years 8 months ago
Reasoning About Approximate Match Query Results
Join techniques deploying approximate match predicates are fundamental data cleaning operations. A variety of predicates have been utilized to quantify approximate match in such o...
Sudipto Guha, Nick Koudas, Divesh Srivastava, Xiao...
KDD
2007
ACM
156views Data Mining» more  KDD 2007»
16 years 7 months ago
Estimating rates of rare events at multiple resolutions
We consider the problem of estimating occurrence rates of rare events for extremely sparse data, using pre-existing hierarchies to perform inference at multiple resolutions. In pa...
Deepak Agarwal, Andrei Z. Broder, Deepayan Chakrab...
RECOMB
2004
Springer
16 years 6 months ago
Designing multiple simultaneous seeds for DNA similarity search
The challenge of similarity search in massive DNA sequence databases has inspired major changes in BLAST-style alignment tools, which accelerate search by inspecting only pairs of...
Yanni Sun, Jeremy Buhler