Sciweavers

5329 search results - page 368 / 1066
» The Weighted Majority Algorithm
Sort
View
CORR
2010
Springer
130views Education» more  CORR 2010»
15 years 6 months ago
Phase Transitions for Greedy Sparse Approximation Algorithms
A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, s...
Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner...
PRL
2010
188views more  PRL 2010»
15 years 1 months ago
A fast divisive clustering algorithm using an improved discrete particle swarm optimizer
As an important technique for data analysis, clustering has been employed in many applications such as image segmentation, document clustering and vector quantization. Divisive cl...
Liang Feng, Ming-Hui Qiu, Yu-Xuan Wang, Qiao-Liang...
INFOCOM
2006
IEEE
16 years 24 days ago
Design and Evaluation of a Fast and Robust Worm Detection Algorithm
— Fast spreading worms are a reality, as amply demonstrated by worms such as Slammer, which reached its peak propagation in a matter of minutes. With these kinds of fast spreadin...
Tian Bu, Aiyou Chen, Scott A. Vander Wiel, Thomas ...
ASC
2008
15 years 6 months ago
Info-fuzzy algorithms for mining dynamic data streams
Most data mining algorithms assume static behavior of the incoming data. In the real world, the situation is different and most continuously collected data streams are generated by...
Lior Cohen, Gil Avrahami, Mark Last, Abraham Kande...
JMIV
2007
143views more  JMIV 2007»
15 years 6 months ago
Measures for Benchmarking of Automatic Correspondence Algorithms
Automatic localisation of correspondences for the construction of Statistical Shape Models from examples has been the focus of intense research during the last decade. Several alg...
Anders Ericsson, Johan Karlsson