293 search results - page 21 / 59 » Geometric algorithms for clearance based optimal path comput... |
149
click to vote
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
—The paper deals with efficient distribution of timely information to flows of mobile devices. We consider the case where a set of Information Dissemination Devices (IDDs) broa...
DAC
1996
ACM
15 years 3 months ago
1996
ACM
In this paper we address the problem of code generation for basic blocks in heterogeneous memory-register DSP processors. We propose a new a technique, based on register-transfer ...
107
click to vote
MOBIHOC
2002
ACM
15 years 11 months ago
2002
ACM
Topological changes in mobile ad hoc networks frequently render routing paths unusable. Such recurrent path failures have detrimental effects on the network ability to support QoS...
110
click to vote
COMPGEOM
2006
ACM
15 years 1 months ago
2006
ACM
We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay [4] as ...
107
click to vote
ICDCS
2008
IEEE
15 years 6 months ago
2008
IEEE
Network coding has been a prominent approach to a series of problems that used to be considered intractable with traditional transmission paradigms. Recent work on network coding ...