Sciweavers

12825 search results - page 25 / 2565
» Improved PLSOM algorithm
Sort
View
CISS
2008
IEEE
14 years 3 months ago
Improved bounds for a deterministic sublinear-time Sparse Fourier Algorithm
—This paper improves on the best-known runtime and measurement bounds for a recently proposed Deterministic sublinear-time Sparse Fourier Transform algorithm (hereafter called DS...
Mark A. Iwen, Craig V. Spencer
ICRA
2005
IEEE
100views Robotics» more  ICRA 2005»
14 years 2 months ago
Improved Signal To Noise Ratio And Computational Speed For Gradient-Based Detection Algorithms
— Image gradient-based feature detectors offer great advantages over their standard edge-only equivalents. In driver support systems research, the radial symmetry detection algor...
Nick Barnes
CCS
2004
ACM
14 years 2 months ago
On achieving software diversity for improved network security using distributed coloring algorithms
It is widely believed that diversity in operating systems, software packages, and hardware platforms will decrease the virulence of worms and the effectiveness of repeated applic...
Adam J. O'Donnell, Harish Sethu
CORR
2011
Springer
137views Education» more  CORR 2011»
13 years 3 months ago
An improvement of the Moser-Tardos algorithmic local lemma
A recent theorem of Bissacot, et al. proved using results about the cluster expansion in statistical mechanics extends the Lov´asz Local Lemma by weakening the conditions under w...
Wesley Pegden
EKAW
2004
Springer
14 years 2 months ago
Incremental Knowledge Acquisition for Improving Probabilistic Search Algorithms
A new incremental knowledge acquisition approach for the effective development of efficient problem solvers for combinatorial problems based on probabilistic search algorithms is ...
J. P. Bekmann, Achim G. Hoffmann