Sciweavers

258 search results - page 36 / 52
» Weak Bisimulation Approximants
Sort
View
GECCO
2005
Springer
107views Optimization» more  GECCO 2005»
15 years 5 months ago
Investigating the success of spatial coevolution
We investigate the results of coevolution of spatially distributed populations. In particular, we describe work in which a simple function approximation problem is used to compare...
Nathan Williams, Melanie Mitchell
ADHOCNOW
2004
Springer
15 years 5 months ago
Range-Free Ranking in Sensors Networks and Its Applications to Localization
We address the question of finding sensors’ coordinates, or at least an approximation of them, when the sensors’ abilities are very weak. In a d dimensional space, we define ...
Zvi Lotker, Marc Martinez de Albeniz, Stephane Per...
CSCW
2000
ACM
15 years 4 months ago
Using Web annotations for asynchronous collaboration around documents
Digital web-accessible annotations are a compelling medium for personal comments and shared discussions around documents. Only recently supported by widely used products, “in-co...
Jonathan J. Cadiz, Anoop Gupta, Jonathan Grudin
MICCAI
1999
Springer
15 years 4 months ago
Understanding the "Demon's Algorithm": 3D Non-rigid Registration by Gradient Descent
The “Demons Algorithm” in increasingly used for non-rigid registration of 3D medical images. However, if it is fast and usually accurate, the algorithm is based on intuitive id...
Xavier Pennec, Pascal Cachier, Nicholas Ayache
FSE
1997
Springer
210views Cryptology» more  FSE 1997»
15 years 3 months ago
Partitioning Cryptanalysis
Matsui's linear cryptanalysis for iterated block ciphers is generalized to an attack called. This attack exploits a weakness that can be described by an e ective partition-pa...
Carlo Harpes, James L. Massey