1161 search results - page 106 / 233 » Approximation schemes for clustering problems |
173
Voted
ESANN
2006
15 years 4 months ago
2006
The Self-Organizing map (SOM), a powerful method for data mining and cluster extraction, is very useful for processing data of high dimensionality and complexity. Visualization met...
119
Voted
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
We prove that the problem of computing an Arrow-Debreu market equilibrium is PPAD-complete even when all traders use additively separable, piecewise-linear and concave utility fun...
128
Voted
EDBT
2004
ACM
16 years 3 months ago
2004
ACM
We present a novel anytime version of partitional clustering algorithm, such as k-Means and EM, for time series. The algorithm works by leveraging off the multi-resolution property...
134
Voted
ISPAN
2005
IEEE
15 years 9 months ago
2005
IEEE
An important requirement for the effective scheduling of parallel applications on large heterogeneous clusters is a current view of system resource availability. Maintaining such ...
138
click to vote
AAAI
2007
15 years 5 months ago
2007
We present Cluster Onset Detection (COD), a novel algorithm to aid in detection of epidemic outbreaks. COD employs unsupervised learning techniques in an online setting to partiti...