Sciweavers

3630 search results - page 83 / 726
» Fast Marching Methods
Sort
View
SDM
2010
SIAM
151views Data Mining» more  SDM 2010»
13 years 11 months ago
Fast Stochastic Frank-Wolfe Algorithms for Nonlinear SVMs
The high computational cost of nonlinear support vector machines has limited their usability for large-scale problems. We propose two novel stochastic algorithms to tackle this pr...
Hua Ouyang, Alexander Gray
NIPS
2008
13 years 11 months ago
QUIC-SVD: Fast SVD Using Cosine Trees
The Singular Value Decomposition is a key operation in many machine learning methods. Its computational cost, however, makes it unscalable and impractical for applications involvi...
Michael P. Holmes, Alexander G. Gray, Charles Lee ...
ITIIS
2008
110views more  ITIIS 2008»
13 years 10 months ago
Fast Detection of Distributed Global Scale Network Attack Symptoms and Patterns in High-speed Backbone Networks
Traditional attack detection schemes based on packets or flows have very high computational complexity. And, network based anomaly detection schemes can reduce the complexity, but...
Sun Ho Kim, Byeong-hee Roh
TIP
2010
163views more  TIP 2010»
13 years 5 months ago
Fast Image Recovery Using Variable Splitting and Constrained Optimization
We propose a new fast algorithm for solving one of the standard formulations of image restoration and reconstruction which consists of an unconstrained optimization problem where t...
Manya V. Afonso, José M. Bioucas-Dias, M&aa...
ISBRA
2010
Springer
14 years 5 months ago
Fast Computation of the Exact Hybridization Number of Two Phylogenetic Trees
Abstract. Hybridization is a reticulate evolutionary process. An established problem on hybridization is computing the minimum number of hybridization events, called the hybridizat...
Yufeng Wu, Jiayin Wang