664 search results - page 62 / 133 » Solution to the Counterfeit Coin Problem and its Generalizat... |
FSTTCS
2001
Springer
15 years 2 months ago
2001
Springer
Semidefinite programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain perf...
DESRIST
2009
Springer
15 years 1 months ago
2009
Springer
In this paper, we describe the concept of ontological design. We show how ontologies can be used as cognitive maps of complex, ill-structured, plastic problems. They can be used t...
106
click to vote
KAIS
2006
14 years 9 months ago
2006
Abstract. Many supervised machine learning tasks can be cast as multi-class classification problems. Support vector machines (SVMs) excel at binary classification problems, but the...
118
click to vote
SIGMOD
2011
ACM
14 years 19 days ago
2011
ACM
Projective Clustering Ensembles (PCE) are a very recent advance in data clustering research which combines the two powerful tools of clustering ensembles and projective clustering...
105
click to vote
SIGECOM
2011
ACM
14 years 19 days ago
2011
ACM
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...