1355 search results - page 147 / 271 » Alternating Timed Automata over Bounded Time |
102
Voted
PERCOM
2006
ACM
16 years 3 months ago
2006
ACM
A recent flooding algorithm [1] guaranteed correctness for networks with dynamic edges and fixed nodes. The algorithm provided a partial answer to the highly dynamic network (HDN)...
195
Voted
ICML
2006
IEEE
16 years 3 days ago
2006
IEEE
We present a tree data structure for fast
nearest neighbor operations in general n-
point metric spaces (where the data set con-
sists of n points). The data structure re-
quir...
116
click to vote
GMP
2006
IEEE
15 years 9 months ago
2006
IEEE
Abstract. This paper presents the mathematical framework, and develops algorithms accordingly, to continuously and robustly track the intersection curves of two deforming parametri...
215
click to vote
ASPDAC
2006
ACM
15 years 9 months ago
2006
ACM
With shrinking technology, the timing variation of a digital circuit is becoming the most important factor while designing a functionally reliable circuit. Gate sizing has emerged...
119
Voted
CONCUR
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. For many cryptographic protocols, security relies on the assumption that adversarial entities have limited computational power. This type of security degrades progressive...