3495 search results - page 182 / 699 » On the random satisfiable process |
133
click to vote
ICPR
2008
IEEE
16 years 5 months ago
2008
IEEE
Error Correcting Output Codes (ECOC) represent a successful framework to deal with multi-class categorization problems based on combining binary classifiers. In this paper, we pre...
146
Voted
STOC
2003
ACM
16 years 5 months ago
2003
ACM
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our appro...
121
Voted
COLT
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We establish a generic theoretical tool to construct probabilistic bounds for algorithms where the output is a subset of objects from an initial pool of candidates (or mo...
129
Voted
EUROCRYPT
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We present two universally composable and practical protocols by which a dealer can, verifiably and non-interactively, secret-share an integer among a set of players. Mo...
127
click to vote
ISSAC
2007
Springer
15 years 10 months ago
2007
Springer
We briefly present and analyze, from a geometric viewpoint, strategies for designing algorithms to factor bivariate approximate polynomials in [x, y]. Given a composite polyno...