Sciweavers

5608 search results - page 757 / 1122
» On the Theory of Matchgate Computations
Sort
View
COMPGEOM
2009
ACM
16 years 1 months ago
Proximity of persistence modules and their diagrams
Topological persistence has proven to be a key concept for the study of real-valued functions defined over topological spaces. Its validity relies on the fundamental property tha...
Frédéric Chazal, David Cohen-Steiner...
P2P
2007
IEEE
161views Communications» more  P2P 2007»
16 years 1 months ago
The BitCod Client: A BitTorrent Clone using Network Coding
Network coding is an emerging field of research with sound and mature theory supporting it. Recent works shows that it has many benefits like improved fault tolerance, higher ...
Danny Bickson, Roy Borer
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
16 years 28 days ago
On the runtime analysis of the 1-ANT ACO algorithm
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carst...
ICALP
2007
Springer
16 years 28 days ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson
PARELEC
2006
IEEE
16 years 24 days ago
MPI and Non-MPI Simulations for Epitaxial Surface Growth
Usually, theories of surface growth are based on the study of global processes without taking in account the local behaviour of atoms. We have implemented two Montecarlo simulation...
Carmen B. Navarrete, Susana Holgado, Eloy Anguiano