Sciweavers

308 search results - page 21 / 62
» How Fast Is the k-Means Method
Sort
View
182
Voted
BMCBI
2004
167views more  BMCBI 2004»
15 years 3 months ago
Feature selection for splice site prediction: A new method using EDA-based feature ranking
Background: The identification of relevant biological features in large and complex datasets is an important step towards gaining insight in the processes underlying the data. Oth...
Yvan Saeys, Sven Degroeve, Dirk Aeyels, Pierre Rou...
SIAMJO
2010
130views more  SIAMJO 2010»
14 years 10 months ago
A Randomized Cutting Plane Method with Probabilistic Geometric Convergence
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
Fabrizio Dabbene, P. S. Shcherbakov, Boris T. Poly...
140
Voted
FOCM
2002
140views more  FOCM 2002»
15 years 3 months ago
Adaptive Wavelet Methods II - Beyond the Elliptic Case
This paper is concerned with the design and analysis of adaptive wavelet methods for systems of operator equations. Its main accomplishment is to extend the range of applicability...
Albert Cohen, Wolfgang Dahmen, Ronald A. DeVore
132
Voted
SIGGRAPH
1999
ACM
15 years 7 months ago
ArtDefo: Accurate Real Time Deformable Objects
We present an algorithm for fast, physically accurate simulation of deformable objects suitable for real time animation and virtual environment interaction. We describe the bounda...
Doug L. James, Dinesh K. Pai
137
Voted
JPDC
2008
135views more  JPDC 2008»
15 years 3 months ago
Fast parallel GPU-sorting using a hybrid algorithm
This paper presents an algorithm for fast sorting of large lists using modern GPUs. The method achieves high speed by efficiently utilizing the parallelism of the GPU throughout th...
Erik Sintorn, Ulf Assarsson