2342 search results - page 332 / 469 » Sublinear geometric algorithms |
111
click to vote
SODA
2004
ACM
15 years 4 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
120
click to vote
SGP
2003
15 years 4 months ago
2003
We present “contact levels of detail” (CLOD), a novel concept for multiresolution collision detection. Given a polyhedral model, our algorithm automatically builds a “dual h...
132
click to vote
ISMB
1994
15 years 4 months ago
1994
Wepresent algorithms for kinematic manipulation of molecular chains subject to fixed bond lengths and bond angles. They are useful for calculating conformations of a molecule subj...
111
click to vote
WALCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract. Computing visible information, such as a visible surface determination, is a significant problem and has been mainly studied in the fields of computational geometry and...
116
click to vote
SIGIR
2010
ACM
15 years 3 months ago
2010
ACM
Resource selection is an important task in Federated Search to select a small number of most relevant information sources. Current resource selection algorithms such as GlOSS, COR...