Sciweavers

2514 search results - page 366 / 503
» On the Computation of Approximations of Database Queries
Sort
View
216
Voted
ICCV
2009
IEEE
15 years 4 months ago
Efficient indexing for large scale visual search
With the popularity of "bag of visual terms" representations of images, many text indexing techniques have been applied in large-scale image retrieval systems. However, ...
Xiao Zhang, Zhiwei Li, Lei Zhang, Wei-Ying Ma, Heu...
ECCV
2002
Springer
16 years 8 months ago
Implicit Probabilistic Models of Human Motion for Synthesis and Tracking
Abstract. This paper addresses the problem of probabilistically modeling 3D human motion for synthesis and tracking. Given the high dimensional nature of human motion, learning an ...
Hedvig Sidenbladh, Michael J. Black, Leonid Sigal
ADC
2007
Springer
145views Database» more  ADC 2007»
16 years 1 months ago
The Privacy of k-NN Retrieval for Horizontal Partitioned Data -- New Methods and Applications
Recently, privacy issues have become important in clustering analysis, especially when data is horizontally partitioned over several parties. Associative queries are the core retr...
Artak Amirbekyan, Vladimir Estivill-Castro
217
Voted
DKE
2007
153views more  DKE 2007»
15 years 6 months ago
Adaptive similarity search in streaming time series with sliding windows
The challenge in a database of evolving time series is to provide efficient algorithms and access methods for query processing, taking into consideration the fact that the databas...
Maria Kontaki, Apostolos N. Papadopoulos, Yannis M...
184
Voted
ICALP
2005
Springer
16 years 11 days ago
Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval
We prove new lower bounds for locally decodable codes and private information retrieval. We show that a 2-query LDC encoding nbit strings over an ℓ-bit alphabet, where the decode...
Stephanie Wehner, Ronald de Wolf