Sciweavers

3019 search results - page 533 / 604
» Approximating the Domatic Number
Sort
View
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
15 years 7 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
121
Voted
WDAG
1990
Springer
80views Algorithms» more  WDAG 1990»
15 years 7 months ago
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
Ofer Biran, Shlomo Moran, Shmuel Zaks
136
Voted
QOSA
2010
Springer
15 years 7 months ago
Validating Model-Driven Performance Predictions on Random Software Systems
Abstract. Software performance prediction methods are typically validated by taking an appropriate software system, performing both performance predictions and performance measurem...
Vlastimil Babka, Petr Tuma, Lubomír Bulej
GFKL
2007
Springer
163views Data Mining» more  GFKL 2007»
15 years 7 months ago
Fast Support Vector Machine Classification of Very Large Datasets
In many classification applications, Support Vector Machines (SVMs) have proven to be highly performing and easy to handle classifiers with very good generalization abilities. Howe...
Janis Fehr, Karina Zapien Arreola, Hans Burkhardt
147
Voted
ASPLOS
2006
ACM
15 years 7 months ago
Accurate and efficient regression modeling for microarchitectural performance and power prediction
We propose regression modeling as an efficient approach for accurately predicting performance and power for various applications executing on any microprocessor configuration in a...
Benjamin C. Lee, David M. Brooks