123 search results - page 20 / 25 » Complexity of Boolean Functions on PRAMs - Lower Bound Techn... |
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
Boosting is a popular approach for building accurate classifiers. Despite the initial popular belief, boosting algorithms do exhibit overfitting and are sensitive to label noise. ...
SI3D
2006
ACM
14 years 1 months ago
2006
ACM
We present an interactive algorithm to compute discretized 3D Euclidean distance fields. Given a set of piecewise linear geometric primitives, our algorithm computes the distance...
STOC
2004
ACM
14 years 7 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
TAMC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
ASPLOS
2006
ACM
14 years 1 months ago
2006
ACM
Sketching is a software synthesis approach where the programmer develops a partial implementation — a sketch — and a separate specification of the desired functionality. The ...