215 search results - page 41 / 43 » Approximating Geometrical Graphs via |
114
click to vote
JMLR
2012
13 years 2 months ago
2012
One approach to modeling structured discrete data is to describe the probability of states via an energy function and Gibbs distribution. A recurring difficulty in these models is...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
We consider the following model for fire containment. We are given an undirected graph G = (V, E) with a source vertex s where the fire starts. At each time step, the firefighters...
102
click to vote
CIKM
2004
Springer
15 years 5 months ago
2004
Springer
The Google search engine uses a method called PageRank, together with term-based and other ranking techniques, to order search results returned to the user. PageRank uses link ana...
115
click to vote
ICCAD
1999
IEEE
15 years 4 months ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
127
click to vote
PAMI
2010
14 years 6 months ago
2010
In this paper, we present a novel approach to 3D face matching that shows high effectiveness in distinguishing facial differences between distinct individuals from differences indu...