Sciweavers

274 search results - page 41 / 55
» Computational complexity of queries based on itemsets
Sort
View
NDSS
2008
IEEE
15 years 6 months ago
Usable PIR
In [22] we showed that existing single-server computational private information retrieval (PIR) protocols for the purpose of preserving client access patterns leakage are orders o...
Peter Williams, Radu Sion
ICCSA
2007
Springer
15 years 2 months ago
Improving the Customization of Natural Language Interface to Databases Using an Ontology
Natural language interfaces to databases are considered one of the best alternatives for final users who wish to make complex, uncommon and frequent queries, which is a very common...
M. Jose A. Zarate, Rodolfo A. Pazos, Alexander F. ...
88
Voted
COCO
2005
Springer
128views Algorithms» more  COCO 2005»
15 years 6 months ago
More on Noncommutative Polynomial Identity Testing
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
Andrej Bogdanov, Hoeteck Wee
VECPAR
2004
Springer
15 years 5 months ago
Distributed Processing of Large BioMedical 3D Images
The Human Genetics Unit (HGU) of the Medical Research Council (MRC) in Edinburgh has developed the Edinburgh Mouse Atlas, a spatial temporal framework to store and analyze biologic...
Konstantinos Liakos, Albert Burger, Richard A. Bal...
109
Voted
BMVC
2010
14 years 10 months ago
Evaluation of dimensionality reduction methods for image auto-annotation
Image auto-annotation is a challenging task in computer vision. The goal of this task is to predict multiple words for generic images automatically. Recent state-of-theart methods...
Hideki Nakayama, Tatsuya Harada, Yasuo Kuniyoshi