10414 search results - page 470 / 2083 » An efficient algorithm for Co-segmentation |
291
click to vote
SIGMOD
2007
ACM
16 years 7 months ago
2007
ACM
Top-k processing in uncertain databases is semantically and computationally different from traditional top-k processing. The interplay between query scores and data uncertainty ma...
323
click to vote
SIGMOD
2005
ACM
16 years 7 months ago
2005
ACM
Given a set of objects P and a query point q, a k nearest neighbor (k-NN) query retrieves the k objects in P that lie closest to q. Even though the problem is well-studied for sta...
202
click to vote
SIGMOD
2004
ACM
16 years 7 months ago
2004
ACM
Peer data management systems (PDMS) offer a flexible architecture for decentralized data sharing. In a PDMS, every peer is associated with a schema that represents the peer's...
193
click to vote
EDBT
2004
ACM
16 years 7 months ago
2004
ACM
XML suffers from the major limitation of high redundancy. Even if compression can be beneficial for XML data, however, once compressed, the data can be seldom browsed and queried i...
224
click to vote
I3D
2010
ACM
16 years 4 months ago
2010
ACM
In this paper we examine the possibilities of using voxel representations as a generic way for expressing complex and feature-rich geometry on current and future GPUs. We present ...