3837 search results - page 417 / 768 » Learning Approximate Consistencies |
234
Voted
INFOCOM
2006
IEEE
16 years 1 months ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
181
click to vote
SWAT
2004
Springer
16 years 28 days ago
2004
Springer
Let A and B be two sets of n resp. m disjoint unit disks in the plane, with m ≥ n. We consider the problem of finding a translation or rigid motion of A that maximizes the tota...
209
click to vote
SIGMOD
2008
ACM
15 years 7 months ago
2008
ACM
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
386
click to vote
Lecture Notes
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
204
click to vote
ECCV
2008
Springer
16 years 9 months ago
2008
Springer
We propose a new algorithm for two-phase, piecewise-smooth segmentation with shape prior. The image is segmented by a binary template that is deformed by a regular geometric transf...