Sciweavers

1830 search results - page 348 / 366
» Workshop on Graph Computation Models
Sort
View
SIGGRAPH
1997
ACM
14 years 1 months ago
Metropolis light transport
We present a new Monte Carlo method for solving the light transport problem, inspired by the Metropolis sampling method in computational physics. To render an image, we generate a...
Eric Veach, Leonidas J. Guibas
PODS
1994
ACM
138views Database» more  PODS 1994»
14 years 27 days ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman
CVPR
2008
IEEE
14 years 10 months ago
Automatic face naming with caption-based supervision
We consider two scenarios of naming people in databases of news photos with captions: (i) finding faces of a single person, and (ii) assigning names to all faces. We combine an in...
Matthieu Guillaumin, Thomas Mensink, Jakob J. Verb...
ECCV
2006
Springer
14 years 10 months ago
An Integral Solution to Surface Evolution PDEs Via Geo-cuts
We introduce a new approach to modelling gradient flows of contours and surfaces. While standard variational methods (e.g. level sets) compute local interface motion in a different...
Yuri Boykov, Vladimir Kolmogorov, Daniel Cremers, ...
WWW
2002
ACM
14 years 9 months ago
Topic-sensitive PageRank
In the original PageRank algorithm for improving the ranking of search-query results, a single PageRank vector is computed, using the link structure of the Web, to capture the rel...
Taher H. Haveliwala