1511 search results - page 94 / 303 » Randomness, lowness and degrees |
180
click to vote
INFOCOM
2007
IEEE
16 years 1 months ago
2007
IEEE
—Valiant’s concept of Randomized Load Balancing (RLB), also promoted under the name ‘two-phase routing’, has previously been shown to provide a cost-effective way of implem...
192
click to vote
CPC
1999
15 years 6 months ago
1999
Total path length, or search cost, for a rooted tree is defined as the sum of all root-to-node distances. Let Tn be the total path length for a random recursive tree of order n. M...
181
click to vote
WWW
2006
ACM
16 years 7 months ago
2006
ACM
We revisit a problem introduced by Bharat and Broder almost a decade ago: how to sample random pages from the corpus of documents indexed by a search engine, using only the search...
214
click to vote
TMC
2011
15 years 1 months ago
2011
—We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Âð1Þ time units per histogram sample on a ra...
236
click to vote
TSMC
2011
15 years 1 months ago
2011
— Consider a scenario in which the data owner has some private/sensitive data and wants a data miner to access it for studying important patterns without revealing the sensitive ...