5592 search results - page 171 / 1119 » On Random Betweenness Constraints |
154
click to vote
IPPS
2007
IEEE
15 years 11 months ago
2007
IEEE
Until now, structured and unstructured networks have been considered in absentia of each other. We believe that next-generation P2P services will require both structured and unstr...
136
click to vote
COLT
2007
Springer
15 years 11 months ago
2007
Springer
In the standard model of observational learning, n agents sequentially decide between two alternatives a or b, one of which is objectively superior. Their choice is based on a stoc...
137
click to vote
ICALP
2007
Springer
15 years 11 months ago
2007
Springer
We present lower bounds on the space required to estimate the quantiles of a stream of numerical values. Quantile estimation is perhaps the most studied problem in the data stream ...
126
click to vote
CLUSTER
2006
IEEE
15 years 11 months ago
2006
IEEE
The RandomAccess benchmark as defined by the High Performance Computing Challenge (HPCC) tests the speed at which a machine can update the elements of a table spread across globa...
194
click to vote
ICDM
2006
IEEE
15 years 11 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...