3653 search results - page 376 / 731 » On Recognizable Timed Languages |
194
click to vote
APPROX
2007
Springer
16 years 28 days ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
187
click to vote
IUI
2006
ACM
16 years 22 days ago
2006
ACM
Sketch interfaces provide more natural interaction than the traditional mouse and palette tool, but can be time consuming to build if they have to be built anew for each new domai...
188
click to vote
CONCUR
2004
Springer
16 years 4 days ago
2004
Springer
We describe the expressive power of temporal branching time logics that use the modalities EX and EF. We give a forbidden pattern characterization of the tree languages definable...
165
click to vote
COCO
2004
Springer
15 years 10 months ago
2004
Springer
Juedes and Lutz (1995) proved a small span theorem for polynomial-time many-one reductions in exponential time. This result says that for language A decidable in exponential time,...
189
Voted
ASPLOS
2008
ACM
15 years 8 months ago
2008
ACM
Memory errors are a notorious source of security vulnerabilities that can lead to service interruptions, information leakage and unauthorized access. Because such errors are also ...