727 search results - page 82 / 146 » One line and n points |
HICSS
2006
IEEE
15 years 4 months ago
2006
IEEE
— We propose a single source reliable broadcasting algorithm for linear grid-based networks where a message is guaranteed to be delivered to all the nodes of the network. The nod...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
The k-means method is a widely used clustering algorithm. One of its distinguished features is its speed in practice. Its worst-case running-time, however, is exponential, leaving...
CORR
2006
Springer
14 years 10 months ago
2006
Springer
Abstract. An unfolding of a polyhedron is produced by cutting the surface and flattening to a single, connected, planar piece without overlap (except possibly at boundary points). ...
IJCGA
2000
14 years 10 months ago
2000
We present e cient algorithms for several instances of the following facility location problem. Facilities and demand sites are represented as points in the plane. Place k obnoxio...
ASSETS
2004
ACM
15 years 3 months ago
2004
ACM
Point estimation is a relatively unexplored facet of sonification. We present a new computer application, the Audio Abacus, designed to transform numbers into tones following the ...