Sciweavers

7522 search results - page 238 / 1505
» Spacing memetic algorithms
Sort
View
DCC
2008
IEEE
16 years 6 months ago
Probabilistic algorithm for finding roots of linearized polynomials
A probabilistic algorithm is presented for finding a basis of the root space of a linearized polynomial L(x) = t i=0 Lixqi over Fqn . The expected time complexity of the presented ...
Vitaly Skachek, Ron M. Roth
ENTCS
2008
68views more  ENTCS 2008»
15 years 6 months ago
The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems
This paper introduces a new algorithm dedicated to the rigorous reachability analysis of nonlinear dynamical systems. The algorithm is initially presented in the context of discre...
Pieter Collins, Alexandre Goldsztejn
ESCAPE
2007
Springer
212views Algorithms» more  ESCAPE 2007»
16 years 24 days ago
Streaming Algorithms for Data in Motion
We propose two new data stream models: the reset model and the delta model, motivated by applications to databases, and to tracking the location of spatial points. We present algor...
Michael Hoffmann 0002, S. Muthukrishnan, Rajeev Ra...
CCCG
2006
15 years 8 months ago
A Simple Streaming Algorithm for Minimum Enclosing Balls
We analyze an extremely simple approximation algorithm for computing the minimum enclosing ball (or the 1-center) of a set of points in high dimensions. We prove that this algorit...
Hamid Zarrabi-Zadeh, Timothy M. Chan
DCC
2008
IEEE
16 years 6 months ago
A Simple Algorithm for Computing the Lempel Ziv Factorization
We give a space-efficient simple algorithm for computing the Lempel?Ziv factorization of a string. For a string of length n over an integer alphabet, it runs in O(n) time independ...
Maxime Crochemore, Lucian Ilie, W. F. Smyth