18306 search results - page 3332 / 3662 » Algorithmics in Exponential Time |
341
click to vote
SIGMOD
2006
ACM
16 years 3 months ago
2006
ACM
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
137
click to vote
SIGMOD
2004
ACM
16 years 3 months ago
2004
ACM
Real-time surveillance systems, network and telecommunication systems, and other dynamic processes often generate tremendous (potentially infinite) volume of stream data. Effectiv...
151
click to vote
SIGMOD
2004
ACM
16 years 3 months ago
2004
ACM
Mining informative patterns from very large, dynamically changing databases poses numerous interesting challenges. Data summarizations (e.g., data bubbles) have been proposed to c...
145
click to vote
SIGMOD
2003
ACM
16 years 3 months ago
2003
ACM
Most relational query optimizers make use of information about the costs of accessing tuples and data structures on various storage devices. This information can at times be off b...
142
click to vote
PODS
2008
ACM
16 years 3 months ago
2008
ACM
A fundamental problem in distributed computation is the distributed evaluation of functions. The goal is to determine the value of a function over a set of distributed inputs, in ...