Sciweavers

2797 search results - page 119 / 560
» Code query by example
Sort
View
116
Voted
TCC
2012
Springer
227views Cryptology» more  TCC 2012»
13 years 10 months ago
Hardness Preserving Constructions of Pseudorandom Functions
We show a hardness-preserving construction of a PRF from any length doubling PRG which improves upon known constructions whenever we can put a non-trivial upper bound q on the numb...
Abhishek Jain, Krzysztof Pietrzak, Aris Tentes
ICDE
2007
IEEE
110views Database» more  ICDE 2007»
16 years 4 months ago
Pointwise-Dense Region Queries in Spatio-temporal Databases
Applications such as traffic management and resource scheduling for location-based services commonly need to identify regions with high concentrations of moving objects. Such quer...
Jinfeng Ni, Chinya V. Ravishankar
EDBT
2006
ACM
150views Database» more  EDBT 2006»
16 years 2 months ago
On Futuristic Query Processing in Data Streams
Recent advances in hardware technology have resulted in the ability to collect and process large amounts of data. In many cases, the collection of the data is a continuous process ...
Charu C. Aggarwal
128
Voted
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
15 years 8 months ago
Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go?
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...
Xiaoming Sun, Andrew Chi-Chih Yao, Shengyu Zhang
144
Voted
SSDBM
2002
IEEE
109views Database» more  SSDBM 2002»
15 years 7 months ago
Query Processing with Description Logic Ontologies Over Object-Wrapped Databases
This paper presents an approach to answering queries over an ontology modelled using a description logic. The ontology acts as a global schema, providing a declarative description...
Martin Peim, Enrico Franconi, Norman W. Paton, Car...