500 search results - page 87 / 100 » Approximation algorithms for maximum independent set of pseu... |
FOCS
2009
IEEE
15 years 8 months ago
2009
IEEE
In the classical balls-and-bins paradigm, where n balls are placed independently and uniformly in n bins, typically the number of bins with at least two balls in them is Θ(n) and ...
110
click to vote
CAV
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. When a model does not satisfy a given specification, a counterexample is produced by the model checker to demonstrate the failure. A user must then examine the counterexa...
118
Voted
INFOCOM
2006
IEEE
15 years 7 months ago
2006
IEEE
— We study the complexity of a spectrum of design problems for optical networks in order to carry a set of demands. Under wavelength division multiplexing (WDM) technology, deman...
139
Voted
COMGEO
2008
ACM
15 years 1 months ago
2008
ACM
We consider algorithms for finding the optimal location of a simple transportation device, that we call a moving walkway, consisting of a pair of points in the plane between which ...
132
click to vote
KDD
2005
ACM
15 years 7 months ago
2005
ACM
We present a probabilistic model-based framework for distributed learning that takes into account privacy restrictions and is applicable to scenarios where the different sites ha...