Sciweavers

5329 search results - page 24 / 1066
» The Weighted Majority Algorithm
Sort
View
CORR
2006
Springer
153views Education» more  CORR 2006»
13 years 7 months ago
A distributed approximation algorithm for the minimum degree minimum weight spanning trees
Fischer proposes in [4] a sequential algorithm to compute a minimum weight spanning tree of maximum degree at most b + logb n in time O n4+1/ln b for any constant b > 1, where ...
Christian Lavault, Mario Valencia-Pabon
ICASSP
2008
IEEE
14 years 2 months ago
A fast approximate joint diagonalization algorithm using a criterion with a block diagonal weight matrix
We propose a new algorithm for Approximate Joint Diagonalization (AJD) with two main advantages over existing state-of-the-art algorithms: Improved overall running speed, especial...
Petr Tichavský, Arie Yeredor, Jan Nielsen
ICPP
1987
IEEE
13 years 11 months ago
Parallel Algorithm for Maximum Weight Matching in Trees
We present an efficient coarse grained parallel algorithm for computing a maximum weight matching in trees. A divide and conquer approach based on centroid decomposition of trees ...
Shaunak Pawagi
CIAC
2010
Springer
194views Algorithms» more  CIAC 2010»
14 years 12 days ago
An Algorithmic Framework for Motif Discovery Problems in Weighted Sequences
A weighted sequence is a string in which a set of characters may appear at each position with respective probabilities of occurrence. A common task is to locate a given motif in a ...
Hui Zhang, Qing Guo, Costas S. Iliopoulos
JCP
2008
145views more  JCP 2008»
13 years 7 months ago
An Effective Mining Algorithm for Weighted Association Rules in Communication Networks
The mining of weighted association rules is one of the primary methods used in communication alarm correlation analysis. With large communication alarm database, the traditional me...
Jian Wu, Xing ming Li