Sciweavers

467 search results - page 70 / 94
» Acceleration of Shortest Path and Constrained Shortest Path ...
Sort
View
DATE
2006
IEEE
91views Hardware» more  DATE 2006»
13 years 11 months ago
Efficient incremental clock latency scheduling for large circuits
The clock latency scheduling problem is usually solved on the sequential graph, also called register-to-register graph. In practice, the the extraction of the sequential graph for...
Christoph Albrecht
ICCV
2007
IEEE
14 years 9 months ago
Novel Depth Cues from Uncalibrated Near-field Lighting
We present the first method to compute depth cues from images taken solely under uncalibrated near point lighting. A stationary scene is illuminated by a point source that is move...
Sanjeev J. Koppal, Srinivasa G. Narasimhan
WAOA
2005
Springer
152views Algorithms» more  WAOA 2005»
14 years 26 days ago
Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost
We study computational and coordination efficiency issues of Nash equilibria in symmetric network congestion games. We first propose a simple and natural greedy method that comput...
Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. ...
ICRA
2008
IEEE
140views Robotics» more  ICRA 2008»
14 years 1 months ago
Dynamic visibility checking for vision-based motion planning
— An important problem in position-based visual servoing (PBVS) is to guarantee that a target will remain within the field of view for the duration of the task. In this paper, w...
Simon Léonard, Elizabeth A. Croft, James J....
ICRA
2003
IEEE
132views Robotics» more  ICRA 2003»
14 years 20 days ago
Optimal strategies to track and capture a predictable target
— We present an O(n log1+ε n)-time algorithm for computing the optimal robot motion that maintains lineof-sight visibility between a target moving inside a polygon with n vertic...
Alon Efrat, Héctor H. González-Ba&nt...