1709 search results - page 184 / 342 » Comparing the Performance of Database Selection Algorithms |
191
click to vote
PAMI
2011
15 years 1 months ago
2011
— This paper proposes a novel method for recognizing faces degraded by blur using deblurring of facial images. The main issue is how to infer a Point Spread Function (PSF) repres...
182
Voted
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
Finding latent patterns in high dimensional data is an important research problem with numerous applications. The most well known approaches for high dimensional data analysis are...
161
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
The topic of managing uncertain data has been explored in many ways. Different methodologies for data storage and query processing have been proposed. As the availability of manag...
347
click to vote
ICDE
2012
IEEE
13 years 8 months ago
2012
IEEE
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
189
click to vote
CIKM
2004
Springer
15 years 10 months ago
2004
Springer
Materialized views defined over distributed data sources are a well recognized technology for modern applications. Stateof-the-art incremental view maintenance requires O(n2 ) or ...