Sciweavers

8025 search results - page 144 / 1605
» Combinators Introduction: An Algorithm
Sort
View
NIPS
2007
15 years 3 months ago
Boosting Algorithms for Maximizing the Soft Margin
We present a novel boosting algorithm, called SoftBoost, designed for sets of binary labeled examples that are not necessarily separable by convex combinations of base hypotheses....
Manfred K. Warmuth, Karen A. Glocer, Gunnar Rä...
102
Voted
JIPS
2006
129views more  JIPS 2006»
15 years 1 months ago
ASVMRT: Materialized View Selection Algorithm in Data Warehouse
: In order to acquire a precise and quick response to an analytical query, proper selection of the views to materialize in the data warehouse is crucial. In traditional view select...
Jin-Hyuk Yang, In-Jeong Chung
COMPSAC
2011
IEEE
14 years 1 months ago
Dynamic Request Management Algorithms for Web-Based Services in Cloud Computing
—Providers of Web-based services can take advantage of many convenient features of cloud computing infrastructures, but they still have to implement request management algorithms...
Riccardo Lancellotti, Mauro Andreolini, Claudia Ca...
ALT
2004
Springer
15 years 10 months ago
Relative Loss Bounds and Polynomial-Time Predictions for the k-lms-net Algorithm
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...
Mark Herbster
IPPS
2007
IEEE
15 years 8 months ago
Performance Analysis of a Family of WHT Algorithms
This paper explores the correlation of instruction counts and cache misses to runtime performance for a large family of divide and conquer algorithms to compute the Walsh–Hadama...
Michael Andrews, Jeremy Johnson