Sciweavers

678 search results - page 131 / 136
» The Theory of Weak Stabilization
Sort
View
COCO
2005
Springer
150views Algorithms» more  COCO 2005»
14 years 1 months ago
The Quantum Adversary Method and Classical Formula Size Lower Bounds
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
Sophie Laplante, Troy Lee, Mario Szegedy
INFOCOM
2003
IEEE
14 years 23 days ago
Sensor-Centric Quality of Routing in Sensor Networks
Abstract— Standard embeded sensor nework models emphasize energy efficiency and distributed decision-making by considering untethered and unattended sensors. To this we add two ...
Rajgopal Kannan, Sudipta Sarangi, S. Sitharama Iye...
MOBICOM
2003
ACM
14 years 22 days ago
Throughput capacity of random ad hoc networks with infrastructure support
In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under the present support of an infinite capacity infrastructure network. Such a...
Ulas C. Kozat, Leandros Tassiulas
PLDI
2003
ACM
14 years 22 days ago
Checking and inferring local non-aliasing
In prior work [15] we studied a language construct restrict that allows programmers to specify that certain pointers are not aliased to other pointers used within a lexical scope....
Alexander Aiken, Jeffrey S. Foster, John Kodumal, ...
CPM
2001
Springer
211views Combinatorics» more  CPM 2001»
14 years 5 hour ago
Fuzzy Hamming Distance: A New Dissimilarity Measure
Lempel Ziv Coding (Extended Abstract). . . . . . . . . . . . . . . . . . . . . . . 18 Shmuel Tomi Klein, Yair Wiseman Approximate Matching of Run-Length Compressed Strings . . . . ...
Abraham Bookstein, Shmuel T. Klein, Timo Raita