397 search results - page 15 / 80 » Geometrical plenoptic sampling |
177
Voted
COMPGEOM
2011
ACM
14 years 5 months ago
2011
ACM
Many real-world data sets can be viewed of as noisy samples of special types of metric spaces called metric graphs [16]. Building on the notions of correspondence and GromovHausdo...
114
click to vote
ADG
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We propose an algorithm for automated recognition of computationally constructed curves and discuss several aspects of the recognition problem. Recognizing loci means det...
WSC
2004
15 years 3 months ago
2004
Exactly computing network reliability measures is an NPhard problem. Therefore, Monte Carlo simulation has been frequently used by network designers to obtain accurate estimates. ...
105
click to vote
CGF
2007
15 years 1 months ago
2007
In this paper, we show how recent GPUs can be used to very efficiently and conveniently sample the visibility between two surfaces, given a set of occluding triangles. We use bitw...
JCC
2007
15 years 1 months ago
2007
Abstract: A novel self-organizing algorithm for conformational sampling is introduced, in which precomputed conformations of rigid fragments are used as templates to enforce the de...