1082 search results - page 58 / 217 » Approximation Algorithms for Spreading Points |
PAKDD
2007
ACM
14 years 1 months ago
2007
ACM
Catching the recent trend of data is an important issue when mining frequent itemsets from data streams. To prevent from storing the whole transaction data within the sliding windo...
SIAMCOMP
2008
13 years 7 months ago
2008
Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...
ICTAI
2006
IEEE
14 years 1 months ago
2006
IEEE
Mean shift based feature space analysis has been shown to be an elegant, accurate and robust technique. The elegance in this non-parametric algorithm is mainly due to its simplici...
SODA
2001
ACM
13 years 9 months ago
2001
ACM
Consider an edge-weighted tree T = (V, E, w : E R+ ), in which a subset R of the nodes (called the required nodes) are colored red and the remaining nodes in S = V \R are colored ...
COMGEO
2008
ACM
13 years 7 months ago
2008
ACM
We present an algorithm for approximating a given open polygonal curve with a minimum number of circular arcs. In computer-aided manufacturing environments, the paths of cutting t...