344 search results - page 47 / 69 » The Directed Minimum Latency Problem |
ICCV
2009
IEEE
16 years 2 months ago
2009
IEEE
This paper proposes a new affine registration algorithm
for matching two point sets in IR2 or IR3. The input point
sets are represented as probability density functions, using
e...
IJFCS
1998
14 years 9 months ago
1998
Directed acyclic graphs (dags) are often used to model circuits. Path lengths in such dags represent circuit delays. In the vertex splitting problem, the objective is to determine...
121
click to vote
CDC
2010
IEEE
14 years 4 months ago
2010
IEEE
The problem considered in the present article is optimal design of network topologies in multi-agent systems in order to make communication on the network as efficient as possible ...
INFOCOM
2002
IEEE
15 years 2 months ago
2002
IEEE
A multigigabit IP router may receive several millions packets per second from each input link. For each packet, the router needs to find the longest matching prefix in the forw...
102
click to vote
ICCAD
1999
IEEE
15 years 1 months ago
1999
IEEE
We consider the problem of finding an optimal clock schedule, i.e. optimal arrival times for clock signals at latches of a VLSI chip. We describe a general model which includes al...