1485 search results - page 135 / 297 » Whole Program Paths |
119
click to vote
GLVLSI
2010
IEEE
15 years 4 months ago
2010
IEEE
For timing-driven or yield-driven designs, non-tree routing has become more and more popular and additional loops provide the redundant paths to protect against the effect of the ...
100
Voted
ASPDAC
2005
ACM
15 years 4 months ago
2005
ACM
— A method for timing driven placement is presented. The core of the approach is optimal timing-driven relaxed placement based on a linear programming (LP) formulation. The formu...
167
click to vote
CVPR
2011
IEEE
14 years 12 months ago
2011
IEEE
We analyze the computational problem of multi-object tracking in video sequences. We formulate the problem using a cost function that requires estimating the number of tracks, as ...
126
Voted
INFOCOM
2011
IEEE
14 years 6 months ago
2011
IEEE
—This paper develops a mesh network protection scheme that guarantees a quantifiable minimum grade of service upon a failure within a network. The scheme guarantees that a fract...
208
click to vote
ICDE
2008
IEEE
16 years 3 months ago
2008
IEEE
Network data models are frequently used as a mechanism to describe the connectivity between spatial features in many emerging GIS applications (location-based services, transporta...