1331 search results - page 229 / 267 » Complexity bounds for zero-test algorithms |
IJAC
2006
13 years 7 months ago
2006
It has been conjectured that in a braid group, or more generally in a Garside group, applying any sequence of monotone equivalences and word reversings can increase the length of a...
JCST
2008
13 years 7 months ago
2008
Detecting duplicates in data streams is an important problem that has a wide range of applications. In general, precisely detecting duplicates in an unbounded data stream is not fe...
COCO
2004
Springer
13 years 11 months ago
2004
Springer
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
SPAA
2003
ACM
14 years 29 days ago
2003
ACM
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
SIGMOD
2010
ACM
14 years 16 days ago
2010
ACM
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...