Sciweavers

5221 search results - page 337 / 1045
» An On-line Problem Database
Sort
View
ICIAR
2010
Springer
15 years 5 months ago
Face Recognition from Color Images Using Sparse Projection Analysis
The paper presents a novel feature extraction technique for face recognition which uses sparse projection axes to compute a lowdimensional representation of face images. The propos...
Vitomir Struc, Nikola Pavesic
SIGMOD
2011
ACM
206views Database» more  SIGMOD 2011»
14 years 9 months ago
Sampling based algorithms for quantile computation in sensor networks
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
Zengfeng Huang, Lu Wang, Ke Yi, Yunhao Liu
SIGMOD
2007
ACM
169views Database» more  SIGMOD 2007»
16 years 6 months ago
Genome-scale disk-based suffix tree indexing
With the exponential growth of biological sequence databases, it has become critical to develop effective techniques for storing, querying, and analyzing these massive data. Suffi...
Benjarath Phoophakdee, Mohammed J. Zaki
PODS
2008
ACM
165views Database» more  PODS 2008»
16 years 6 months ago
Data exchange and schema mappings in open and closed worlds
In the study of data exchange one usually assumes an openworld semantics, making it possible to extend instances of target schemas. An alternative closed-world semantics only move...
Leonid Libkin, Cristina Sirangelo
CRYPTO
2000
Springer
157views Cryptology» more  CRYPTO 2000»
15 years 11 months ago
Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing
Private information retrieval (PIR) enables a user to retrieve a data item from a database, replicated among one or more servers, while hiding the identity of the retrieved item. ...
Amos Beimel, Yuval Ishai, Tal Malkin