6365 search results - page 156 / 1273 » Fast Local Computation Algorithms |
156
click to vote
MOBIHOC
2004
ACM
16 years 4 months ago
2004
ACM
We propose several novel localized algorithms to construct energy efficient routing structures for homogeneous wireless ad hoc networks, where all nodes have same maximum transmis...
140
click to vote
CVPR
2003
IEEE
16 years 7 months ago
2003
IEEE
In this paper, we describe an algorithm called Fast Marching Watersheds that segments a triangle mesh into visual parts. This computer vision algorithm leverages a human vision th...
169
click to vote
SGP
2007
15 years 7 months ago
2007
We present two new Delaunay refinement algorithms, second an extension of the first. For a given input domain (a set of points or a planar straight line graph), and a threshold an...
142
click to vote
BROADNETS
2004
IEEE
15 years 8 months ago
2004
IEEE
This paper studies the important fault management issue with focus on the fast restoration mechanisms for Optical Burst Switched (OBS) networks. In order to reduce the burst losse...
147
click to vote
SGP
2003
15 years 6 months ago
2003
Point sets become an increasingly popular shape representation. Most shape processing and rendering tasks require the approximation of a continuous surface from the point data. We...