5329 search results - page 223 / 1066 » The Weighted Majority Algorithm |
188
click to vote
ICIP
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper we present an algorithm which uses adaptive selection of low-level features for main subject detection. The algorithm first computes low-level features such as contr...
185
click to vote
WABI
2007
Springer
16 years 1 months ago
2007
Springer
The aim of the motif recognition problem is to detect a set of mutually similar subsequences within a collection of biological sequences. The weak motif recognition problem on DNA ...
190
click to vote
SPAA
2005
ACM
16 years 20 days ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
202
Voted
EVOW
2004
Springer
16 years 15 days ago
2004
Springer
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...
175
Voted
ISCAS
2003
IEEE
16 years 11 days ago
2003
IEEE
Improving testability during the early stages of High-Level Synthesis (HLS) has several benefits, including reduced test hardware overhead, reduced test costs, reduced design iter...