Sciweavers

75 search results - page 7 / 15
» Approximating Optimal Binary Decision Trees
Sort
View
APPROX
2005
Springer
136views Algorithms» more  APPROX 2005»
14 years 1 months ago
What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization
The field of stochastic optimization studies decision making under uncertainty, when only probabilistic information about the future is available. Finding approximate solutions to...
Anupam Gupta, Martin Pál, R. Ravi, Amitabh ...
ICPR
2006
IEEE
14 years 8 months ago
ECOC-ONE: A Novel Coding and Decoding Strategy
Error correcting output codes (ECOC) represent a classification technique that allows a successful extension of binary classifiers to address the multiclass problem. In this paper...
Oriol Pujol, Sergio Escalera
SIAMCOMP
2002
142views more  SIAMCOMP 2002»
13 years 7 months ago
On Binary Searching with Nonuniform Costs
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
Eduardo Sany Laber, Ruy Luiz Milidiú, Artur...
CVPR
2011
IEEE
13 years 3 months ago
Mining Discriminative Co-occurrence Patterns for Visual Recognition
The co-occurrence pattern, a combination of binary or local features, is more discriminative than individual features and has shown its advantages in object, scene, and action rec...
Junsong Yuan, Ming Yang, Ying Wu
ICASSP
2008
IEEE
14 years 2 months ago
Outage capacity of a cooperative scheme with binary input and a simple relay
Cooperative communications is a rapidly evolving research area. Most of the cooperative protocols that have appeared in the literature assume slow flat fading channels and Gaussi...
George N. Karystinos, Athanasios P. Liavas