Sciweavers

5329 search results - page 702 / 1066
» The Weighted Majority Algorithm
Sort
View
COCO
1991
Springer
112views Algorithms» more  COCO 1991»
15 years 10 months ago
Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
Rafi Heiman, Avi Wigderson
ADMA
2008
Springer
124views Data Mining» more  ADMA 2008»
15 years 8 months ago
Dimensionality Reduction for Classification
We investigate the effects of dimensionality reduction using different techniques and different dimensions on six two-class data sets with numerical attributes as pre-processing fo...
Frank Plastria, Steven De Bruyne, Emilio Carrizosa
APPROX
2008
Springer
89views Algorithms» more  APPROX 2008»
15 years 8 months ago
Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
Hang Dinh, Alexander Russell
DAGM
2008
Springer
15 years 8 months ago
Space-Time Multi-Resolution Banded Graph-Cut for Fast Segmentation
Abstract. Applying real-time segmentation is a major issue when processing every frame of image sequences. In this paper, we propose a modification of the well known graph-cut algo...
Tobi Vaudrey, Daniel Gruber, Andreas Wedel, Jens K...
EVOW
2008
Springer
15 years 8 months ago
A Hybrid Random Subspace Classifier Fusion Approach for Protein Mass Spectra Classification
Classifier fusion strategies have shown great potential to enhance the performance of pattern recognition systems. There is an agreement among researchers in classifier combination...
Amin Assareh, Mohammad Hassan Moradi, L. Gwenn Vol...