Sciweavers

768 search results - page 18 / 154
» Asymptotic Cellular Complexity
Sort
View
IM
2007
14 years 9 months ago
Pursuit-Evasion in Models of Complex Networks
Vertex pursuit games, such as the game of Cops and Robbers, are a simplified model for network security. In these games, cops try to capture a robber loose on the vertices of the ...
Anthony Bonato, Pawel Pralat, Changping Wang
70
Voted
ISSAC
2007
Springer
94views Mathematics» more  ISSAC 2007»
15 years 3 months ago
Faster algorithms for the characteristic polynomial
A new randomized algorithm is presented for computing the characteristic polynomial of an n × n matrix over a field. Over a sufficiently large field the asymptotic expected com...
Clément Pernet, Arne Storjohann
ECAL
1999
Springer
15 years 1 months ago
Arithmetic Operations on Self-Replicating Cellular Automata
In this paper, we present a possible implementation of arithmetic functions (notably, addition and multiplication) using self-replicating cellular automata. The operations are per...
Enrico Petraglio, Jean-Marc Henry, Gianluca Tempes...
ICIAP
1999
ACM
15 years 1 months ago
Cellular Automata Based Optical Flow Computation for "Just-in-Time" Applications
Real-world tasks often require real-time performances. However, in many practical cases, “just in time” responses are sufficient. This means that a system should be efficien...
Giovanni Adorni, Stefano Cagnoni, Monica Mordonini
AUSAI
2006
Springer
15 years 1 months ago
Data Clustering and Visualization Using Cellular Automata Ants
This paper presents two novel features of an emergent data visualization method coined "cellular ants": unsupervised data class labeling and shape negotiation. This metho...
Andrew Vande Moere, Justin James Clayden, Andy Don...