1949 search results - page 263 / 390 » Random graphs on surfaces |
158
click to vote
CVPR
2011
IEEE
15 years 1 months ago
2011
IEEE
Reconstructing transparent objects is a challenging problem. While producing reasonable results for quite complex objects, existing approaches require custom calibration or somewh...
129
click to vote
WWW
2003
ACM
16 years 5 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...
125
click to vote
RANDOM
1998
Springer
15 years 8 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 ...
127
click to vote
CORR
2008
Springer
15 years 4 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...
135
click to vote
CORR
2011
Springer
14 years 11 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...