Sciweavers

1647 search results - page 257 / 330
» Improved Randomized Approximation Algorithms for Lot-Sizing ...
Sort
View
PODC
2010
ACM
14 years 24 days ago
A new technique for distributed symmetry breaking
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
Johannes Schneider, Roger Wattenhofer
SIGMOD
1998
ACM
96views Database» more  SIGMOD 1998»
14 years 1 months ago
Wavelet-Based Histograms for Selectivity Estimation
Query optimization is an integral part of relational database management systems. One important task in query optimization is selectivity estimation, that is, given a query P, we ...
Yossi Matias, Jeffrey Scott Vitter, Min Wang
DAS
2006
Springer
14 years 18 days ago
Combining Multiple Classifiers for Faster Optical Character Recognition
Traditional approaches to combining classifiers attempt to improve classification accuracy at the cost of increased processing. They may be viewed as providing an accuracy-speed tr...
Kumar Chellapilla, Michael Shilman, Patrice Simard
ECCV
2010
Springer
14 years 2 months ago
Optimizing Complex Loss Functions in Structured Prediction
Abstract. In this paper we develop an algorithm for structured prediction that optimizes against complex performance measures, those which are a function of false positive and fals...
HM
2009
Springer
145views Optimization» more  HM 2009»
14 years 1 months ago
A Hybrid Solver for Large Neighborhood Search: Mixing Gecode and EasyLocal + +
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....
Raffaele Cipriano, Luca Di Gaspero, Agostino Dovie...