30 search results - page 6 / 6 » Spanners of Additively Weighted Point Sets |
COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
In this paper we develop an efficient implementation for a k-means clustering algorithm. The novel feature of our algorithm is that it uses coresets to speed up the algorithm. A ...
CMMR
2008
Springer
13 years 7 months ago
2008
Springer
Realtime musical expression through synthesis is notoriously dicult. The complete potential of a sound engine is traditionally available only at design time. In this paper two mapp...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
COLT
2006
Springer
13 years 9 months ago
2006
Springer
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
ICDM
2009
IEEE
13 years 12 months ago
2009
IEEE
—Identifying modules, or natural communities, in large complex networks is fundamental in many fields, including social sciences, biological sciences and engineering. Recently s...