Sciweavers

745 search results - page 126 / 149
» The origins of combinatorics on words
Sort
View
PLDI
2010
ACM
15 years 7 months ago
Breadcrumbs: Efficient Context Sensitivity for Dynamic Bug Detection Analyses
Calling context--the set of active methods on the stack--is critical for understanding the dynamic behavior of large programs. Dynamic program analysis tools, however, are almost ...
Michael D. Bond, Graham Z. Baker, Samuel Z. Guyer
CTRSA
2009
Springer
128views Cryptology» more  CTRSA 2009»
15 years 4 months ago
Short Redactable Signatures Using Random Trees
Abstract. A redactable signature scheme for a string of objects supports verification even if multiple substrings are removed from the original string. It is important that the re...
Ee-Chien Chang, Chee Liang Lim, Jia Xu
EFORENSICS
2009
Springer
15 years 4 months ago
Vocal Forgery in Forensic Sciences
Abstract. This article describes techniques of vocal forgery able to affect automatic speaker recognition system in a forensic context. Vocal forgery covers two main aspects: voice...
Patrick Perrot, Mathieu Morel, Joseph Razik, G&eac...
FSTTCS
2009
Springer
15 years 4 months ago
Covering of ordinals
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...
Laurent Braud
ICIDS
2009
Springer
15 years 4 months ago
Say Anything: A Demonstration of Open Domain Interactive Digital Storytelling
Say Anything is a text-based interactive digital storytelling application that differs from other systems in its emphasis on the ability of users to create a narrative in any domai...
Reid Swanson, Andrew S. Gordon