Sciweavers

1355 search results - page 147 / 271
» Alternating Timed Automata over Bounded Time
Sort
View
PERCOM
2006
ACM
14 years 8 months ago
A Dynamic Graph Algorithm for the Highly Dynamic Network Problem
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)...
Edwin Soedarmadji, Robert J. McEliece
ICML
2006
IEEE
14 years 5 months ago
Cover Trees for Nearest Neighbor
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...
Alina Beygelzimer, Sham Kakade, John Langford
GMP
2006
IEEE
137views Solid Modeling» more  GMP 2006»
14 years 3 months ago
Theoretically Based Robust Algorithms for Tracking Intersection Curves of Two Deforming Parametric Surfaces
Abstract. This paper presents the mathematical framework, and develops algorithms accordingly, to continuously and robustly track the intersection curves of two deforming parametri...
Xianming Chen, Richard F. Riesenfeld, Elaine Cohen...
ASPDAC
2006
ACM
129views Hardware» more  ASPDAC 2006»
14 years 3 months ago
Yield-area optimizations of digital circuits using non-dominated sorting genetic algorithm (YOGA)
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...
Vineet Agarwal, Janet Meiling Wang
CONCUR
2008
Springer
13 years 11 months ago
Modeling Computational Security in Long-Lived Systems
Abstract. For many cryptographic protocols, security relies on the assumption that adversarial entities have limited computational power. This type of security degrades progressive...
Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nan...