103 search results - page 19 / 21 » The Cover Time of Random Digraphs |
SODA
2008
ACM
13 years 8 months ago
2008
ACM
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
MOBICOM
2005
ACM
14 years 16 days ago
2005
ACM
In old times, castles were surrounded by moats (deep trenches filled with water, and even alligators) to thwart or discourage intrusion attempts. One can now replace such barrier...
IASTEDSE
2004
13 years 8 months ago
2004
Pairwise coverage of factors affecting software has been proposed to screen for potential errors. Techniques to generate test suites for pairwise coverage are evaluated according ...
STOC
2004
ACM
14 years 7 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
CIKM
2009
Springer
14 years 1 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...