1542 search results - page 223 / 309 » The metamathematics of random graphs |
104
Voted
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
126
click to vote
ICML
2007
IEEE
16 years 2 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 ...
113
click to vote
INFOCOM
2009
IEEE
15 years 8 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...
124
click to vote
FOCS
2008
IEEE
15 years 8 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
129
click to vote
PKDD
2007
Springer
15 years 7 months ago
2007
Springer
Recent years have seen the development of many graph clustering algorithms, which can identify community structure in networks. The vast majority of these only find disjoint commun...