779 search results - page 126 / 156 » Algorithms for the Sample Mean of Graphs |
COMGEO
2008
ACM
14 years 12 months ago
2008
ACM
A wireless ad-hoc network can be represented as a graph in which the nodes represent wireless devices, and the links represent pairs of nodes that communicate directly by means of...
114
click to vote
4OR
2010
14 years 10 months ago
2010
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
114
click to vote
PG
2007
IEEE
2007
IEEE
Statistical Hypothesis Testing for Assessing Monte Carlo Estimators: Applications to Image Synthesis
15 years 6 months ago
Image synthesis algorithms are commonly compared on the basis of running times and/or perceived quality of the generated images. In the case of Monte Carlo techniques, assessment ...
104
click to vote
PAAPP
2007
14 years 11 months ago
2007
\Web users are nowadays confronted with the huge variety of available information sources whose content is not targeted at any specific group or layer. Recommendation systems aim...
102
click to vote
ECCV
2008
Springer
16 years 1 months ago
2008
Springer
This paper shows how computational Riemannian manifold can be used to solve several problems in computer vision and graphics. Indeed, Voronoi segmentations and Delaunay graphs comp...