4908 search results - page 854 / 982 » On the Complexity of Optimal K-Anonymity |
160
click to vote
COCO
2003
Springer
15 years 11 months ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
187
click to vote
NIS
1998
15 years 6 months ago
1998
The execution time of a large query depends mainly on the memory utilization which should avoid disk accesses for intermediate results. Poor memory management can hurt performance ...
253
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Restoring a clear image from a single motion-blurred
image due to camera shake has long been a challenging
problem in digital imaging. Existing blind deblurring techniques
eithe...
188
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
We address the problem of detecting complex articulated objects and their pose in 3D range scan data. This task is very difficult when the orientation of the object is unknown, an...
183
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...