7006 search results - page 456 / 1402 » Approximation Algorithms |
141
Voted
CIAC
2010
Springer
15 years 8 months ago
2010
Springer
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
119
Voted
ICS
1989
Tsinghua U.
15 years 9 months ago
1989
Tsinghua U.
We consider iterative algorithms of the form z := f(z), executed by a parallel or distributed computing system. We focus on asynchronous implementations whereby each processor ite...
120
click to vote
ICASSP
2008
IEEE
15 years 11 months ago
2008
IEEE
A new technique to acquire pseudo-noise (PN) sequences has been recently proposed in [1] and [2]. It is based on the paradigm of iterative Message Passing (iMP) to be run on loopy...
121
Voted
ESA
2004
Springer
15 years 10 months ago
2004
Springer
Many network applications that need to distribute content and data to a large number of clients use a hybrid scheme in which one (or more) multicast channel is used in parallel to...
167
click to vote
ICIP
2003
IEEE
16 years 6 months ago
2003
IEEE
In this paper, we describe an algorithm to measure the shape complexity for discrete approximations of planar curves in 2D images and manifold surfaces for 3D triangle meshes. We ...