Sciweavers

1736 search results - page 190 / 348
» The rank-width of Directed Graphs
Sort
View
ICCAD
1994
IEEE
117views Hardware» more  ICCAD 1994»
15 years 10 months ago
Optimization of critical paths in circuits with level-sensitive latches
A simple extension of the critical path method is presented which allows more accurate optimization of circuits with level-sensitive latches. The extended formulation provides a s...
Timothy M. Burks, Karem A. Sakallah
GIS
2007
ACM
15 years 10 months ago
Optimal traversal planning in road networks with navigational constraints
A frequent query in geospatial planning and decision making domains (e.g., emergency response, data acquisition, street cleaning), is to find an optimal traversal plan (OTP) that ...
Leyla Kazemi, Cyrus Shahabi, Mehdi Sharifzadeh, Lu...
INFOCOM
2005
IEEE
16 years 3 days ago
Link scheduling in sensor networks: distributed edge coloring revisited
— We consider the problem of link scheduling in a sensor network employing a TDMA MAC protocol. Our link scheduling algorithm involves two phases. In the first phase, we assign ...
Shashidhar Gandham, Milind Dawande, Ravi Prakash
STOC
2003
ACM
126views Algorithms» more  STOC 2003»
16 years 6 months ago
A new approach to dynamic all pairs shortest paths
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
Camil Demetrescu, Giuseppe F. Italiano
ICIAP
2003
ACM
16 years 6 months ago
A shortest path representation for video summarisation
A novel approach is presented to select multiple key frames within an isolated video shot where there is camera motion causing significant scene change. This is achieved by determ...
Sarah V. Porter, Majid Mirmehdi, Barry T. Thomas