Sciweavers

58 search results - page 5 / 12
» A Parallel Algorithm for Weighted Distance Transforms
Sort
View
94
Voted
PARLE
1991
15 years 1 months ago
The Derivation of Distributed Termination Detection Algorithms from Garbage Collection Schemes
It is shown that the terminationdetection problem for distributed computations can be modeled as an instance of the garbage collection problem. Consequently, algorithms for the te...
Gerard Tel, Friedemann Mattern
ICIP
2007
IEEE
14 years 11 months ago
Motion Estimation using Tangent Distance
In this paper, we present a method based on tangent distance to estimate motion in image sequences. Tangent distance combines an intuitive understanding and effective modeling of ...
Jonathan Fabrizio, Séverine Dubuisson
85
Voted
SPAA
2005
ACM
15 years 3 months ago
Name independent routing for growth bounded networks
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
Ittai Abraham, Dahlia Malkhi
3DIM
2003
IEEE
15 years 1 months ago
Efficient Reconstruction of Indoor Scenes with Color
In this paper we present an efficient and general approach to computing and integrating 3D distance fields directly from multiple range images. We compute normal and confidence va...
Rui Wang 0003, David P. Luebke
ICS
2003
Tsinghua U.
15 years 2 months ago
Estimating cache misses and locality using stack distances
Cache behavior modeling is an important part of modern optimizing compilers. In this paper we present a method to estimate the number of cache misses, at compile time, using a mac...
Calin Cascaval, David A. Padua