5595 search results - page 354 / 1119 » Approximation Algorithms for Clustering Problems |
185
click to vote
CAD
2006
Springer
15 years 6 months ago
2006
Springer
Fat conic section and fat conic spline are defined. With well established properties of fat conic splines, the problem of approximating a ruled surface by a tangent smooth cone sp...
304
click to vote
GIS
2006
ACM
16 years 7 months ago
2006
ACM
Moving point object data can be analyzed through the discovery of patterns. We consider the computational efficiency of computing two of the most basic spatio-temporal patterns in...
201
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
199
click to vote
JMLR
2010
15 years 1 months ago
2010
Massive Online Analysis (MOA) is a software environment for implementing algorithms and running experiments for online learning from evolving data streams. MOA is designed to deal...
186
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...