Sciweavers

1439 search results - page 17 / 288
» Fast approximation of centrality
Sort
View
SODA
2008
ACM
122views Algorithms» more  SODA 2008»
14 years 10 days ago
Fast approximation of the permanent for very dense problems
Approximation of the permanent of a matrix with nonnegative entries is a well studied problem. The most successful approach to date for general matrices uses Markov chains to appr...
Mark Huber, Jenny Law
BIODATAMINING
2008
96views more  BIODATAMINING 2008»
13 years 11 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
ISBI
2008
IEEE
14 years 11 months ago
Fast displacement probability profile approximation from HARDI using 4th-order tensors
Cartesian tensor basis have been widely used to approximate spherical functions. In Medical Imaging, tensors of various orders have been used to model the diffusivity function in ...
Angelos Barmpoutis, Baba C. Vemuri, John R. Forder
ICPR
2006
IEEE
15 years 12 hour ago
Metric tree partitioning and Taylor approximation for fast support vector classification
This paper presents a method to speed up support vector classification, especially important when data is highdimensional. Unlike previous approaches which focus on less support v...
Thang V. Pham, Arnold W. M. Smeulders
DATE
2008
IEEE
93views Hardware» more  DATE 2008»
14 years 5 months ago
A Fast Approximation Algorithm for MIN-ONE SAT
In this paper, we propose a novel approximation algorithm (RelaxSAT) for MIN-ONE SAT. RelaxSAT generates a set of constraints from the objective function to guide the search. The ...
Lei Fang, Michael S. Hsiao