2252 search results - page 78 / 451 » Lower Bounds for Dynamic Algorithms |
104
click to vote
ERSHOV
2003
Springer
15 years 6 months ago
2003
Springer
We present several new algorithms as well as new lower and upper bounds for optimizing functions underlying infinite games pertinent to computer-aided verification.
FOCS
2002
IEEE
15 years 6 months ago
2002
IEEE
We consider the problem of testing functions for the property of being a k-junta (i.e., of depending on at most k variables). Fischer, Kindler, Ron, Safra, and Samorodnitsky (J. Co...
EPEW
2007
Springer
15 years 7 months ago
2007
Springer
We consider a class of Markov chains known for its closed form transient and steady-state distributions. We show that some absorbing chains can be also seen as members of this clas...
115
click to vote
IPCCC
2005
IEEE
15 years 7 months ago
2005
IEEE
Localization is a fundamental operation in mobile and self-configuring networks such as sensor networks and mobile ad hoc networks. For example, sensor location is often critical...
108
click to vote
WDAG
2005
Springer
15 years 7 months ago
2005
Springer
We investigate issues related to the probe complexity of the And-Or quorum system and its implementation in a dynamic environment. Our contribution is twofold: We first analyze th...