2095 search results - page 218 / 419 » Improved pebbling bounds |
179
click to vote
LOPSTR
2004
Springer
15 years 12 months ago
2004
Springer
We propose an analysis for detecting procedures and goals that are deterministic (i.e. that produce at most one solution), or predicates whose clause tests are mutually exclusive (...
156
click to vote
COCO
2003
Springer
15 years 11 months ago
2003
Springer
In this paper we give new extremal bounds on polynomial threshold function (PTF) representations of Boolean functions. Our results include the following: • Almost every Boolean ...
184
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
178
click to vote
DCOSS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In this paper we present local distributed algorithms for constructing spanners in wireless sensor networks modeled as unit ball graphs (shortly UBGs) and quasi-unit ball...
205
click to vote
COLT
2000
Springer
15 years 11 months ago
2000
Springer
We describe a novel family of PAC model algorithms for learning linear threshold functions. The new algorithms work by boosting a simple weak learner and exhibit complexity bounds...