Sciweavers

4698 search results - page 37 / 940
» Making Functionality More General
Sort
View
FSTTCS
2003
Springer
15 years 7 months ago
Tagging Makes Secrecy Decidable with Unbounded Nonces as Well
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this...
Ramaswamy Ramanujam, S. P. Suresh
POPL
2011
ACM
14 years 5 months ago
Making prophecies with decision predicates
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
Byron Cook, Eric Koskinen
ICCS
2007
Springer
15 years 8 months ago
A General Long-Time Molecular Dynamics Scheme in Atomistic Systems: Hyperdynamics in Entropy Dominated Systems
Abstract. We extend the hyperdynamics method developed for lowdimensional energy-dominated systems, to simulate slow dynamics in more general atomistic systems. We show that a few ...
Xin Zhou, Yi Jiang
COGSCI
2010
103views more  COGSCI 2010»
15 years 2 months ago
A Computational Account of the Development of the Generalization of Shape Information
Abecassis, Sera, Yonas, and Schwade (2001) have shown that young children represent shapes more metrically, and perhaps more holistically, than do older children and adults. How d...
Leonidas A. A. Doumas, John E. Hummel
DM
2011
211views Education» more  DM 2011»
14 years 6 months ago
A generalization of plexes of Latin squares
A k-plex of a latin square is a collection of cells representing each row, column, and symbol precisely k times. The classic case of k = 1 is more commonly known as a transversal....
Kyle Pula