2004 search results - page 131 / 401 » Sampling from large graphs |
147
click to vote
SI3D
2010
ACM
15 years 10 months ago
2010
ACM
Obscurance and Ambient Occlusion (AO) are popular techniques in both film and games that model how ambient light is shadowed. While it is largely a solved problem for static scen...
113
click to vote
AVBPA
2001
Springer
15 years 7 months ago
2001
Springer
In several pattern recognition problems, particularly in image recognition ones, there are often a large number of features available, but the number of training samples for each p...
132
click to vote
AINA
2003
IEEE
15 years 8 months ago
2003
IEEE
This paper endeavors to present a scheme to detect and estimate bottleneck bandwidth along the path in the Internet. We have participated in the RIPE NCC’s TTM project to perfor...
123
click to vote
CAV
2009
Springer
16 years 3 months ago
2009
Springer
We describe a Markov chain Monte Carlo (MCMC)-based algorithm for sampling solutions to mixed Boolean/integer constraint problems. The focus of this work differs in two points from...
126
click to vote
3DPVT
2006
IEEE
15 years 9 months ago
2006
IEEE
A prerequisite to calibrated camera pose estimation is the construction of a camera neighborhood adjacency graph, a connected graph defining the pose neighbors of the camera set....