Sciweavers

789 search results - page 103 / 158
» On Theory Revision with Queries
Sort
View
FOCS
1998
IEEE
15 years 5 months ago
Quantum Lower Bounds by Polynomials
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
Robert Beals, Harry Buhrman, Richard Cleve, Michel...
162
Voted
VLDB
1997
ACM
175views Database» more  VLDB 1997»
15 years 4 months ago
STING: A Statistical Information Grid Approach to Spatial Data Mining
Spatial data mining, i.e., discovery of interesting characteristics and patterns that may implicitly exist in spatial databases, is a challenging task due to the huge amounts of s...
Wei Wang 0010, Jiong Yang, Richard R. Muntz
INTERSPEECH
2010
14 years 7 months ago
Towards a robust face recognition system using compressive sensing
An application of compressive sensing (CS) theory in imagebased robust face recognition is considered. Most contemporary face recognition systems suffer from limited abilities to ...
Allen Y. Yang, Zihan Zhou, Yi Ma, Shankar Sastry
129
Voted
ICDT
2010
ACM
211views Database» more  ICDT 2010»
15 years 10 months ago
Probabilistic Data Exchange
The work reported here lays the foundations of data exchange in the presence of probabilistic data. This requires rethinking the very basic concepts of traditional data exchange, ...
Ronald Fagin, Benny Kimelfeld, Phokion Kolaitis
IDEAS
2008
IEEE
80views Database» more  IDEAS 2008»
15 years 7 months ago
Improved count suffix trees for natural language data
With more and more natural language text stored in databases, handling respective query predicates becomes very important. Optimizing queries with predicates includes (sub)string ...
Guido Sautter, Cristina Abba, Klemens Böhm