1695 search results - page 312 / 339 » Improved Algorithms for Synchronizing Computer Network Clock... |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
TASLP
2008
13 years 8 months ago
2008
This paper describes an approach for computing a consensus translation from the outputs of multiple machine translation (MT) systems. The consensus translation is computed by weigh...
MOBICOM
2010
ACM
13 years 9 months ago
2010
ACM
We report a first-of-its-kind realization of directional transmission for smartphone-like mobile devices using multiple passive directional antennas, supported by only one RF chai...
DAC
2006
ACM
14 years 9 months ago
2006
ACM
In this paper, we propose a new linear programming based timing driven placement framework for high performance designs. Our LP framework is mainly net-based, but it takes advanta...
DAC
2006
ACM
14 years 9 months ago
2006
ACM
Steiner routing is a fundamental yet NP-hard problem in VLSI design and other research fields. In this paper, we propose to model the routing graph by an RC network with routing t...