10608 search results - page 168 / 2122 » Complexity of O'Hara's Algorithm |
TC
2011
13 years 5 months ago
2011
— Processing the gathered information efficiently is a key functionality for wireless sensor networks. In this article, we study the time complexity, message complexity (number ...
COCO
2004
Springer
14 years 3 months ago
2004
Springer
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolm...
COCO
2003
Springer
14 years 3 months ago
2003
Springer
We review and slightly strengthen known results on the Kolmogorov complexity of prefixes of effectively random sequences. First, there are recursively random random sequences su...
DEXA
2003
Springer
14 years 3 months ago
2003
Springer
Query optimizers in current database management systems (DBMS) often face problems such as intolerably long optimization time and/or poor optimization results when optimizing compl...
ICSM
2002
IEEE
14 years 3 months ago
2002
IEEE
Data manipulation, or algorithmic complexity, is not taken into account adequately in any of the most popular functional size measurement methods. In this paper, we recall some we...