1172 search results - page 116 / 235 » Path Algorithms on Regular Graphs |
127
click to vote
SIGGRAPH
1997
ACM
15 years 4 months ago
1997
ACM
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...
128
Voted
SCAM
2008
IEEE
15 years 7 months ago
2008
IEEE
The JOANA project (Java Object-sensitive ANAlysis) is a program analysis infrastructure for the Java language. It contains a wide range of analysis techniques such as dependence g...
233
click to vote
Lecture Notes
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
104
Voted
CAAN
2007
Springer
15 years 6 months ago
2007
Springer
Topological routing is basically table free, and allows for very fast restoration and thus a high level of reliability in communication. It has already been satisfactorily proposed...
103
Voted
DM
1999
15 years 7 days ago
1999
We examine powers of Hamiltonian paths and cycles as well as Hamiltonian (power) completion problems in several highly structured graph classes. For threshold graphs we give effic...