Sciweavers

13841 search results - page 2689 / 2769
» Algorithms and Constraint Programming
Sort
View
104
Voted
STOC
2006
ACM
149views Algorithms» more  STOC 2006»
16 years 27 days ago
Bounded-error quantum state identification and exponential separations in communication complexity
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald d...
STOC
2002
ACM
156views Algorithms» more  STOC 2002»
16 years 27 days ago
Selfish traffic allocation for server farms
We investigate the price of selfish routing in non-cooperative networks in terms of the coordination and bicriteria ratios in the recently introduced game theoretic network model ...
Artur Czumaj, Piotr Krysta, Berthold Vöcking
SIGMOD
2009
ACM
202views Database» more  SIGMOD 2009»
16 years 25 days ago
ZStream: a cost-based query processor for adaptively detecting composite events
Composite (or Complex) event processing (CEP) systems search sequences of incoming events for occurrences of userspecified event patterns. Recently, they have gained more attentio...
Yuan Mei, Samuel Madden
174
Voted
SIGMOD
2007
ACM
186views Database» more  SIGMOD 2007»
16 years 23 days ago
An efficient and accurate method for evaluating time series similarity
A variety of techniques currently exist for measuring the similarity between time series datasets. Of these techniques, the methods whose matching criteria is bounded by a specifi...
Michael D. Morse, Jignesh M. Patel
SIGMOD
2001
ACM
158views Database» more  SIGMOD 2001»
16 years 22 days ago
Generating Efficient Plans for Queries Using Views
We study the problem of generating e cient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialize...
Foto N. Afrati, Chen Li, Jeffrey D. Ullman
« Prev « First page 2689 / 2769 Last » Next »