Sciweavers

765 search results - page 80 / 153
» Empirical Design of Geometric Algorithms
Sort
View
ECCV
1996
Springer
16 years 1 months ago
Imposing Hard Constraints on Soft Snakes
An approach is presented for imposing generic hard constraints on deformable models at a low computational cost, while preserving the good convergence properties of snake-like mod...
Pascal Fua, Christian Brechbühler
DAC
2008
ACM
16 years 26 days ago
Stochastic integral equation solver for efficient variation-aware interconnect extraction
In this paper we present an efficient algorithm for extracting the complete statistical distribution of the input impedance of interconnect structures in the presence of a large n...
Tarek Moselhy, Luca Daniel
SIGMOD
2004
ACM
166views Database» more  SIGMOD 2004»
16 years 6 hour ago
Fast Computation of Database Operations using Graphics Processors
We present new algorithms on commodity graphics processors to perform fast computation of several common database operations. Specifically, we consider operations such as conjunct...
Naga K. Govindaraju, Brandon Lloyd, Wei Wang 0010,...
SAC
2009
ACM
15 years 6 months ago
Flexible self-healing gradients
Self-healing gradients are distributed estimates of the distance from each device in a network to the nearest device designated as a source, and are used in many pervasive computi...
Jacob Beal
IPSN
2010
Springer
15 years 6 months ago
Covering space for in-network sensor data storage
For in-network storage schemes, one maps data, indexed in a logical space, to the distributed sensor locations. When the physical sensor network has an irregular shape and possibl...
Rik Sarkar, Wei Zeng, Jie Gao, Xianfeng David Gu