1061 search results - page 90 / 213 » Online Correlation Clustering |
KDD
2009
ACM
14 years 8 months ago
2009
ACM
There is a wide variety of data mining methods available, and it is generally useful in exploratory data analysis to use many different methods for the same dataset. This, however...
EUROSYS
2010
ACM
14 years 2 months ago
2010
ACM
The deluge of huge data sets such as those provided by
sensor networks, online transactions, and the web provide
exciting opportunities for data analysis. The scale of the
data ...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
IDEAL
2007
Springer
14 years 2 months ago
2007
Springer
In the information age, online collaboration and social networks are of increasing importance and quickly becoming an integral part of our lifestyle. In business, social networking...
COLT
2005
Springer
13 years 10 months ago
2005
Springer
External regret compares the performance of an online algorithm, selecting among N actions, to the performance of the best of those actions in hindsight. Internal regret compares ...