5329 search results - page 159 / 1066 » The Weighted Majority Algorithm |
205
click to vote
WDAG
2009
Springer
16 years 1 months ago
2009
Springer
We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (∆ + 1)2 synchronous communication rounds,...
149
click to vote
TNN
1998
15 years 6 months ago
1998
—Oja’s principal subspace algorithm is a well-known and powerful technique for learning and tracking principal information in time series. A thorough investigation of the conve...
170
click to vote
TON
2008
15 years 6 months ago
2008
We study the multi-constrained Quality-of-Service (QoS) routing problem where one seeks to find a path from a source to a destination in the presence of K 2 additive end-to-end Qo...
178
click to vote
ISAAC
1998
Springer
15 years 10 months ago
1998
Springer
Let G = (V; E; w) be an undirected graph with nonnegative edge length function w and nonnegative vertex weight function r. The optimal product-requirement communication spanning t...
164
click to vote
VIP
2003
15 years 7 months ago
2003
1 Accurately locating edge points is important for image measurement. This paper describes an edge detection method based on back-propagation algorithm of neural networks. A three-...