Sciweavers

2191 search results - page 292 / 439
» Improving the Efficiency of Non-Deterministic Computations
Sort
View
ICPR
2006
IEEE
14 years 10 months ago
Part-Based Multi-Frame Registration for Estimation of the Growth Of Cellular Networks in Plant Roots
Motion estimation from confocal scanning laser microscope images of growing plant cell structures presents interesting challenges; motion exhibits multiple local discontinuities a...
Timothy J. Roberts, Stephen J. McKenna, J. Hans, T...
ICPR
2000
IEEE
14 years 10 months ago
Cooperation between Level Set Techniques and Dense 3D Registration for the Segmentation of Brain Structures
This paper presents a cooperative strategy between volumetric registration and segmentation. The segmentation method is based on the level set formalism. Starting from an initial ...
C. Baillard, Pierre Hellier, Christian Barillot
PODC
2009
ACM
14 years 10 months ago
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
Riko Jacob, Andréa W. Richa, Christian Sche...
CHI
2002
ACM
14 years 10 months ago
Movement model, hits distribution and learning in virtual keyboarding
In a ten-session experiment, six participants practiced typing with an expanding rehearsal method on an optimized virtual keyboard. Based on a large amount of in-situ performance ...
Shumin Zhai, Alison E. Sue, Johnny Accot
RECOMB
2007
Springer
14 years 10 months ago
How to Achieve an Equivalent Simple Permutation in Linear Time
The problem of Sorting signed permutations by reversals is a well studied problem in computational biology. The first polynomial time algorithm was presented by Hannenhalli and Pev...
Simon Gog, Martin Bader