Sciweavers

290 search results - page 33 / 58
» Local Algorithms: Self-stabilization on Speed
Sort
View
CF
2005
ACM
13 years 11 months ago
Sparse matrix storage revisited
In this paper, we consider alternate ways of storing a sparse matrix and their effect on computational speed. They involve keeping both the indices and the non-zero elements in t...
Malik Silva
CORR
2004
Springer
91views Education» more  CORR 2004»
13 years 9 months ago
Distributed Control by Lagrangian Steepest Descent
Often adaptive, distributed control can be viewed as an iterated game between independent players. The coupling between the players' mixed strategies, arising as the system ev...
David Wolpert, Stefan Bieniawski
ICTAI
2002
IEEE
14 years 2 months ago
Calculus of Variations in Discrete Space for Constrained Nonlinear Dynamic Optimization
In this paper, we propose new dominance relations that can speed up significantly the solution process of nonlinear constrained dynamic optimization problems in discrete time and...
Yixin Chen, Benjamin W. Wah
PAMI
2008
270views more  PAMI 2008»
13 years 9 months ago
Randomized Clustering Forests for Image Classification
This paper introduces three new contributions to the problems of image classification and image search. First, we propose a new image patch quantization algorithm. Other competitiv...
Frank Moosmann, Eric Nowak, Frédéric...
BIBE
2008
IEEE
142views Bioinformatics» more  BIBE 2008»
14 years 4 months ago
Optimizing performance, cost, and sensitivity in pairwise sequence search on a cluster of PlayStations
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
Ashwin M. Aji, Wu-chun Feng