4372 search results - page 192 / 875 » Algorithmic Theories of Everything |
113
click to vote
SOFSEM
2010
Springer
15 years 9 months ago
2010
Springer
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
STOC
2009
ACM
16 years 1 months ago
2009
ACM
We show by means of several examples that robust statistical estimators present an excellent starting point for differentially private estimators. Our algorithms use a new paradig...
75
Voted
ICPR
2008
IEEE
15 years 7 months ago
2008
IEEE
This paper addresses the relationship between the Visual Assessment of cluster Tendency (VAT) algorithm and Dunn’s cluster validity index. We present an analytical comparison in...
85
Voted
ISAAC
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
77
Voted
COMPGEOM
2006
ACM
15 years 6 months ago
2006
ACM
The k-means method is an old but popular clustering algorithm known for its observed speed and its simplicity. Until recently, however, no meaningful theoretical bounds were known...