135 search results - page 25 / 27 » Relating timed and register automata |
ICRA
2009
IEEE
14 years 2 months ago
2009
IEEE
— Scan matching, the problem of registering two laser scans in order to determine the relative positions from which the scans were obtained, is one of the most heavily relied-upo...
ICALP
1990
Springer
13 years 12 months ago
1990
Springer
Any tree can be represented in a max/ma//y compact form as a directed acyclic graph where common subtrees are factored and shared, being represented only once. Such a compaction ca...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
WDAG
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Allowing read operations to return stale data with low probability has been proposed as a means to increase availability in quorums systems. Existing solutions that allow...
HPCA
2000
IEEE
14 years 9 days ago
2000
IEEE
Memorylatency isbecominganincreasingly importantperformance bottleneck, especially in multiprocessors. One technique for tolerating memory latency is multithreading, whereby we sw...