69 search results - page 14 / 14 » The cover time of sparse random graphs |
COLT
2003
Springer
15 years 4 months ago
2003
Springer
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
GLOBECOM
2006
IEEE
15 years 5 months ago
2006
IEEE
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
116
click to vote
ORL
2006
14 years 11 months ago
2006
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
CIKM
2009
Springer
15 years 6 months ago
2009
Springer
We propose a General Markov Framework for computing page importance. Under the framework, a Markov Skeleton Process is used to model the random walk conducted by the web surfer on...