Sciweavers

1949 search results - page 98 / 390
» Random graphs on surfaces
Sort
View
168
Voted
ICRA
1995
IEEE
188views Robotics» more  ICRA 1995»
15 years 7 months ago
Fast Approximation of Range Images by Triangular Meshes Generated through Adaptive Randomized Sampling
This paper describes and evaluates an efficient technique that allows the fast generation of 3D triangular meshes from range images avoiding optimization procedures. Such a tool ...
Miguel Angel García
WWW
2010
ACM
15 years 11 months ago
Tracking the random surfer: empirically measured teleportation parameters in PageRank
PageRank computes the importance of each node in a directed graph under a random surfer model governed by a teleportation parameter. Commonly denoted alpha, this parameter models ...
David F. Gleich, Paul G. Constantine, Abraham D. F...
149
Voted
SODA
1993
ACM
85views Algorithms» more  SODA 1993»
15 years 5 months ago
On Traversing Layered Graphs On-line
The following bounds on the competitive ratios of deterministic and randomized on-line algorithms for traversing width-w layered graphs are obtained.
H. Ramesh
ACL
2009
15 years 2 months ago
Markov Random Topic Fields
Most approaches to topic modeling assume an independence between documents that is frequently violated. We present an topic model that makes use of one or more user-specified grap...
Hal Daume III
PAMI
2010
160views more  PAMI 2010»
15 years 2 months ago
Photometric Stereo via Expectation Maximization
—This paper presents a robust and automatic approach to photometric stereo, where the two main components, namely surface normals and visible surfaces, are respectively optimized...
Tai-Pang Wu, Chi-Keung Tang