54 search results - page 11 / 11 » nn 2002 |
IPL
2007
13 years 10 months ago
2007
For a given connected graph G of order n, a routing R in G is a set of n(n − 1) elementary paths specified for every ordered pair of vertices in G. The vertex (resp. edge) forw...
STOC
2002
ACM
14 years 11 months ago
2002
ACM
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
IJDAR
2002
13 years 10 months ago
2002
Abstract. This paper describes a performance evaluation study in which some efficient classifiers are tested in handwritten digit recognition. The evaluated classifiers include a s...
TSMC
2002
13 years 10 months ago
2002
Abstract--This paper proposes a new algorithm for the reduction of the number of colors in an image. The proposed adaptive color reduction (ACR) technique achieves color reduction ...