2079 search results - page 272 / 416 » Universality of random graphs |
143
click to vote
DC
2008
15 years 4 months ago
2008
This paper determines necessary and sufficient conditions to implement wait-free and non-blocking contention managers in a shared memory system. The necessary conditions hold even...
150
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true d...
684
click to vote
Publication
State-of-the-art person re-identi cation methods seek robust person matching through combining various feature types. Often, these features are implicitly assigned with a single ve...
164
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
A general framework is proposed for gradient boosting in supervised learning problems where the loss function is defined using a kernel over the output space. It extends boosting ...
138
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract—We propose a novel search mechanism for unstructured p2p networks, and show that it is both scalable, i.e., it leads to a bounded query traffic load per peer as the pee...