1604 search results - page 219 / 321 » Approximation algorithms for developable surfaces |
133
click to vote
EGH
2010
Springer
14 years 11 months ago
2010
Springer
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
102
click to vote
CVPR
2007
IEEE
16 years 3 months ago
2007
IEEE
Optimization with graph cuts became very popular in recent years. Progress in problems such as stereo correspondence, image segmentation, etc., can be attributed, in part, to the ...
INFOCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
—We develop diverse routing schemes for dealing with multiple, possibly correlated, failures. While disjoint path protection can effectively deal with isolated single link failur...
BMCBI
2010
15 years 1 months ago
2010
Background: The binding of peptide fragments of extracellular peptides to class II MHC is a crucial event in the adaptive immune response. Each MHC allotype generally binds a dist...
197
click to vote
SIGMOD
2008
ACM
16 years 1 months ago
2008
ACM
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...