Sciweavers

6306 search results - page 112 / 1262
» Space, Time, and the Use of Language
Sort
View
PLDI
1995
ACM
15 years 1 months ago
APT: A Data Structure for Optimal Control Dependence Computation
The control dependence relation is used extensively in restructuring compilers. This relation is usually represented using the control dependence graph; unfortunately, the size of...
Keshav Pingali, Gianfranco Bilardi
HYBRID
1999
Springer
15 years 2 months ago
As Soon as Possible: Time Optimal Control for Timed Automata
In this work we tackle the following problem: given a timed automaton, and a target set F of configurations, restrict its transition relation in a systematic way so that from ever...
Eugene Asarin, Oded Maler
WADS
2009
Springer
265views Algorithms» more  WADS 2009»
15 years 4 months ago
A Distribution-Sensitive Dictionary with Low Space Overhead
The time required for a sequence of operations on a data structure is usually measured in terms of the worst possible such sequence. This, however, is often an overestimate of the ...
Prosenjit Bose, John Howat, Pat Morin
IJCAI
1989
14 years 11 months ago
A Parallel Parser for Spoken Natural Language
This paper describes SYNAPSIS, a parser for performing real-time understanding of spoken utterances in a parallel computational environment. Understanding continuous speech allowi...
Egidio P. Giachin, Claudio Rullent
COCO
2001
Springer
107views Algorithms» more  COCO 2001»
15 years 2 months ago
In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time
Restricting the search space {0, 1}n to the set of truth tables of “easy” Boolean functions on log n variables, as well as using some known hardness-randomness tradeoffs, we ...
Russell Impagliazzo, Valentine Kabanets, Avi Wigde...