1539 search results - page 250 / 308 » Fast and Simple Methods For Computing Control Points |
IJRR
2002
13 years 7 months ago
2002
We present kinetic data structures for detecting collisions between a set of polygons that are moving continuously. Unlike classical collision detection methods that rely on bound...
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
In this paper four mechanisms, fine and coarse grained fitness rating, linguistic evaluation and active user intervention are compared for use in the multi-objective IGA. The inte...
CVPR
2009
IEEE
14 years 2 months ago
2009
IEEE
Recent years have seen the development of fast and accurate algorithms for detecting objects in images. However, as the size of the scene grows, so do the running-times of these a...
RECOMB
2004
Springer
14 years 8 months ago
2004
Springer
In situ staining of a target mRNA at several time points during the development of a D. melanogaster embryo gives one a detailed spatio-temporal view of the expression pattern of ...