1066 search results - page 169 / 214 » Computing Private Set Operations with Linear Complexities |
99
Voted
STOC
2005
ACM
15 years 3 months ago
2005
ACM
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
ICCV
2005
IEEE
15 years 11 months ago
2005
IEEE
We present an efficient method for learning part-based object class models from unsegmented images represented as sets of salient features. A model includes parts' appearance...
PODC
2005
ACM
15 years 3 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
NIPS
2007
14 years 11 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
DAWAK
2005
Springer
15 years 3 months ago
2005
Springer
The queries defined on data warehouses are complex and use several join operations that induce an expensive computational cost. This cost becomes even more prohibitive when querie...