Sciweavers

1949 search results - page 119 / 390
» Random graphs on surfaces
Sort
View
233
Voted
CP
2009
Springer
16 years 5 months ago
On the Structure of Industrial SAT Instances
Abstract. During this decade, it has been observed that many realworld graphs, like the web and some social and metabolic networks, have a scale-free structure. These graphs are ch...
Carlos Ansótegui, Jordi Levy, Maria Luisa B...
CVPR
2003
IEEE
16 years 6 months ago
Surfaces with Occlusions from Layered Stereo
Although steady progress has been made in recent stereo algorithms, producing accurate results in the neighborhood of depth discontinuities remains a challenge. Moreover, among th...
Michael H. Lin, Carlo Tomasi
3DPVT
2006
IEEE
240views Visualization» more  3DPVT 2006»
15 years 10 months ago
Global Depth from Epipolar Volumes--A General Framework for Reconstructing Non-Lambertian Surfaces
Using Epipolar Image Analysis in the context of the correspondence finding problem in depth reconstruction has several advantages. One is the elegant incorporation of prior knowl...
Timo Stich, Art Tevs, Marcus A. Magnor
SIGAL
1990
273views Algorithms» more  SIGAL 1990»
15 years 8 months ago
Randomized Broadcast in Networks
We propose and analyse a quasirandom analogue to the classical push model for disseminating information in networks ("randomized rumor spreading"). In the classical mode...
Uriel Feige, David Peleg, Prabhakar Raghavan, Eli ...
SODA
2008
ACM
131views Algorithms» more  SODA 2008»
15 years 5 months ago
PageRank and the random surfer model
In recent years there has been considerable interest in analyzing random graph models for the Web. We consider two such models - the Random Surfer model, introduced by Blum et al....
Prasad Chebolu, Páll Melsted