7978 search results - page 150 / 1596 » Combining shared-coin algorithms |
106
Voted
NIPS
2007
15 years 5 months ago
2007
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....
121
Voted
JIPS
2006
15 years 3 months ago
2006
: 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...
133
click to vote
ALT
2004
Springer
16 years 16 days ago
2004
Springer
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...
103
Voted
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
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...
141
Voted
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
This work describes a forward-looking approach for the solution of dynamic (time-changing) problems using evolutionary algorithms. The main idea of the proposed method is to combi...