158 search results - page 3 / 32 » The Cover Time, the Blanket Time, and the Matthews Bound |
ICALP
2001
Springer
15 years 2 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
GLOBECOM
2010
IEEE
14 years 7 months ago
2010
IEEE
A mix is a communication proxy that hides the relationship between incoming and outgoing messages. Routing traffic through a path of mixes is a powerful tool for providing privacy....
ISAAC
2000
Springer
15 years 1 months ago
2000
Springer
It has been a challenging open problem whether there is a polynomial time approximation algorithm for the Vertex Cover problem whose approximation ratio is bounded by a constant l...
ICML
2005
IEEE
15 years 10 months ago
2005
IEEE
In this paper we consider sampling based fitted value iteration for discounted, large (possibly infinite) state space, finite action Markovian Decision Problems where only a gener...
70
Voted
ICONIP
2007
14 years 11 months ago
2007
In this paper we eliminate the need for parameter estimation associated with the set covering machine (SCM) by directly minimizing generalization error bounds. Firstly, we consider...