5169 search results - page 32 / 1034 » Locality approximation using time |
108
click to vote
FORMATS
2007
Springer
15 years 8 months ago
2007
Springer
Dierence Bound Matrices (DBMs) are the most commonly used data structure for model checking timed automata. Since long they are being used in successful tools like Kronos or UPPAA...
223
click to vote
POPL
2006
ACM
16 years 2 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
72
Voted
DATE
2003
IEEE
15 years 7 months ago
2003
IEEE
A new computational concept of timing jitter is proposed that is suitable for exploitation in circuit simulators. It is based on the approximation of computed noise characteristic...
153
click to vote
PAMI
2007
15 years 1 months ago
2007
—Tracking deforming objects involves estimating the global motion of the object and its local deformations as a function of time. Tracking algorithms using Kalman filters or part...
129
Voted
ICRA
2000
IEEE
15 years 6 months ago
2000
IEEE
A tele-operated system in a robot greatly reduces the demands on the human operator, although some human intervention is still required to perform such tasks as insulator recognit...