11160 search results - page 300 / 2232 » Incompleteness in a General Setting |
178
click to vote
CVPR
2012
IEEE
13 years 8 months ago
2012
IEEE
In this paper, we address a practical problem of crossscenario clothing retrieval - given a daily human photo captured in general environment, e.g., on street, finding similar cl...
190
Voted
KDD
2001
ACM
16 years 6 months ago
2001
ACM
The similarity join is an important operation for mining high-dimensional feature spaces. Given two data sets, the similarity join computes all tuples (x, y) that are within a dis...
177
click to vote
PODS
2006
ACM
16 years 6 months ago
2006
ACM
Finding icebergs ? items whose frequency of occurrence is above a certain threshold ? is an important problem with a wide range of applications. Most of the existing work focuses ...
193
click to vote
MOBIHOC
2002
ACM
16 years 5 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
163
Voted
ACSC
2008
IEEE
16 years 23 days ago
2008
IEEE
We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication c...