IPL
2008
13 years 9 months ago
2008
Let P be a convex polytope in Rd , d = 3 or 2, with n vertices. We present linear time algorithms for approximating P by simpler polytopes. For instance, one such algorithm select...
IJAIT
2006
13 years 9 months ago
2006
We present an efficient feature selection algorithm for computer aided detection (CAD) computed tomographic (CT) colonography. The algorithm 1) determines an appropriate piecewise...
COGSCI
2007
13 years 9 months ago
2007
Languages are transmitted from person to person and generation to generation via a process of iterated learning: people learn a language from other people who once learned that la...
IPL
2008
13 years 9 months ago
2008
We describe a new algorithm for the problem of perfect sorting a signed permutation by reversals. The worst-case time complexity of this algorithm is parameterized by the maximum p...
CN
2007
13 years 9 months ago
2007
A number of routing algorithms based on the ant-colony metaphor have been proposed for communication networks. However, there has been little work on the performance analysis of a...
INFORMATICALT
2008
13 years 9 months ago
2008
In this paper a detail analysis of speech coding algorithm based on forward adaptive technique is carried out. We consider an algorithm that works on frame-by-frame basis, where a ...
IJVR
2008
13 years 9 months ago
2008
This paper proposes the use of animal flocks to naturally provide spatial clues in adventure video-games. This approach complements the so far proposed mechanisms to support naviga...
CGF
2007
13 years 9 months ago
2007
We present an image-based algorithm for interactive rendering depth-of-field effects in images with depth maps. While previously published methods for interactive depth-of-field...
IJRR
2008
13 years 9 months ago
2008
We consider the problem of grasping novel objects, specifically ones that are being seen for the first time through vision. Grasping a previously unknown object, one for which a 3...
IJRR
2008
13 years 9 months ago
2008
: We present algorithms for computing all placements of two and three fingers that cage a given polygonal object with n edges in the plane. A polygon is caged when it is impossible...