1331 search results - page 199 / 267 » Complexity bounds for zero-test algorithms |
119
click to vote
INFOCOM
2012
IEEE
13 years 8 days ago
2012
IEEE
—A cardinal prerequisite for the system design of a sensor network, is to understand the geometric environment where sensor nodes are deployed. The global topology of a largescal...
LICS
2009
IEEE
15 years 4 months ago
2009
IEEE
We consider the standard model of finite two-person zero-sum stochastic games with signals. We are interested in the existence of almost-surely winning or positively winning stra...
IWMM
2009
Springer
15 years 4 months ago
2009
Springer
The peak heap consumption of a program is the maximum size of the live data on the heap during the execution of the program, i.e., the minimum amount of heap space needed to run t...
ESWS
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. This paper presents a minimalist program for RDF, by showing how one can do without several predicates and keywords of the RDF Schema vocabulary, obtaining a simpler lang...
ICALP
2007
Springer
15 years 4 months ago
2007
Springer
We consider the problem of constructing efficient locally decodable codes in the presence of a computationally bounded adversary. Assuming the existence of one-way functions, we c...