1591 search results - page 213 / 319 » Random lifts of graphs |
163
click to vote
WWW
2003
ACM
16 years 7 months ago
2003
ACM
We propose two new tools to address the evolution of hyperlinked corpora. First, we define time graphs to extend the traditional notion of an evolving directed graph, capturing li...
154
click to vote
RANDOM
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
169
click to vote
CORR
2008
Springer
15 years 6 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...
169
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...
196
click to vote
ICML
2007
IEEE
16 years 7 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 ...