Sciweavers

3630 search results - page 292 / 726
» Fast Marching Methods
Sort
View
DIMVA
2007
15 years 7 months ago
On the Adaptive Real-Time Detection of Fast-Propagating Network Worms
Abstract. We present two light-weight worm detection algorithms that offer significant advantages over fixed-threshold methods. The first algorithm, RBS (ratebased sequential hy...
Jaeyeon Jung, Rodolfo A. Milito, Vern Paxson
DICTA
2003
15 years 7 months ago
Fast Adaptive Algorithm for Time-Critical Color Quantization Application
Color quantization is the process of grouping n data points to k cluster. We proposed a new approach, based on Wu’s color quantization [6]. Our approach can significantly reduce ...
Kiattisin Kanjanawanishkul, Bunyarit Uyyanonvara
SDM
2003
SIAM
123views Data Mining» more  SDM 2003»
15 years 7 months ago
Fast Online SVD Revisions for Lightweight Recommender Systems
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
Matthew Brand
BIODATAMINING
2008
96views more  BIODATAMINING 2008»
15 years 6 months ago
Fast approximate hierarchical clustering using similarity heuristics
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...
Meelis Kull, Jaak Vilo
BMCBI
2010
155views more  BMCBI 2010»
15 years 6 months ago
BISMA - Fast and accurate bisulfite sequencing data analysis of individual clones from unique and repetitive sequences
Background: Bisulfite sequencing is a popular method to analyze DNA methylation patterns at high resolution. A region of interest is targeted by PCR and about 20-50 subcloned DNA ...
Christian Rohde, Yingying Zhang, Richard Reinhardt...