174 search results - page 16 / 35 » Algorithms for center and Tverberg points |
ICDAR
2011
IEEE
12 years 7 months ago
2011
IEEE
—Because of writing styles of different individuals, some of the text-lines may be curved in shape. For recognition of such text-lines, their proper alignment is necessary. In th...
TIT
1998
13 years 7 months ago
1998
—Upper and lower bounds are derived for the decoding complexity of a general lattice L. The bounds are in terms of the dimension n and the coding gain
of L, and are obtained ba...
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...
SIGMOD
1998
ACM
13 years 11 months ago
1998
ACM
Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clust...
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...