Sciweavers

6274 search results - page 178 / 1255
» From query complexity to computational complexity
Sort
View
DOLAP
2006
ACM
15 years 10 months ago
Pre-aggregation with probability distributions
Motivated by the increasing need to analyze complex, uncertain multidimensional data this paper proposes probabilistic OLAP queries that are computed using probability distributio...
Igor Timko, Curtis E. Dyreson, Torben Bach Pederse...
EDBT
2010
ACM
177views Database» more  EDBT 2010»
15 years 6 months ago
PerK: personalized keyword search in relational databases through preferences
Keyword-based search in relational databases allows users to discover relevant information without knowing the database schema or using complicated queries. However, such searches...
Kostas Stefanidis, Marina Drosou, Evaggelia Pitour...
COMPGEOM
2010
ACM
15 years 9 months ago
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen
ASIACRYPT
1991
Springer
15 years 8 months ago
Limitations of the Even-Mansour Construction
In [1] a construction of a block cipher from a single pseudorandom permutation is proposed. In a complexity theoretical setting they prove that this scheme is secure against a pol...
Joan Daemen
COMPLEXITY
2006
91views more  COMPLEXITY 2006»
15 years 4 months ago
The evolution of technology within a simple computer model
Technology--the collection of devices and methods available to human society--evolves by constructing new devices and methods from ones that previously exist, and in turn offering...
W. Brian Arthur, Wolfgang Polak