89 search results - page 15 / 18 » Approximate lineage for probabilistic databases |
CVPR
2006
IEEE
14 years 1 months ago
2006
IEEE
This paper describes an algorithm for pose and illumination invariant face recognition from a single image under occlusions. The method iteratively estimates the parameters of a 3...
AMDO
2008
Springer
13 years 9 months ago
2008
Springer
We present a technique for face recognition in videos. We are able to recognise a face in a video sequence, given a single gallery image. By assuming that the face is in an approxi...
VLDB
2005
ACM
14 years 26 days ago
2005
ACM
The largest databases in use today are so large that answering a query exactly can take minutes, hours, or even days. One way to address this problem is to make use of approximati...
SIGMOD
2010
ACM
14 years 6 days ago
2010
ACM
The K-Nearest Neighbor search (kNN) problem has been investigated extensively in the past due to its broad range of applications. In this paper we study this problem in the contex...
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
In this paper, we will examine the problem of clustering massive domain data streams. Massive-domain data streams are those in which the number of possible domain values for each a...