Sciweavers

1355 search results - page 81 / 271
» Alternating Timed Automata over Bounded Time
Sort
View
CAV
2010
Springer
172views Hardware» more  CAV 2010»
14 years 27 days ago
Symbolic Bounded Synthesis
Abstract. Synthesis of finite state systems from full linear time temporal logic (LTL) specifications is gaining more and more attention as several recent achievements have signi...
Rüdiger Ehlers
POPL
2010
ACM
14 years 6 months ago
Semantics and Algorithms for Data-dependent Grammars
Traditional parser generation technologies are incapable of handling the demands of modern programmers. In this paper, we present the design and theory of a new parsing engine, YA...
Yitzhak Mandelbaum, Trevor Jim, David Walker
FOCS
1991
IEEE
14 years 15 days ago
On the Exponent of the All Pairs Shortest Path Problem
The upper bound on the exponent, ω, of matrix multiplication over a ring that was three in 1968 has decreased several times and since 1986 it has been 2.376. On the other hand, t...
Noga Alon, Zvi Galil, Oded Margalit
SIGMOD
2009
ACM
190views Database» more  SIGMOD 2009»
14 years 9 months ago
Optimizing complex extraction programs over evolving text data
Most information extraction (IE) approaches have considered only static text corpora, over which we apply IE only once. Many real-world text corpora however are dynamic. They evol...
Fei Chen 0002, Byron J. Gao, AnHai Doan, Jun Yang ...
ICDE
2005
IEEE
106views Database» more  ICDE 2005»
14 years 10 months ago
Effective Computation of Biased Quantiles over Data Streams
Skewis prevalentin manydata sourcessuchas IP traffic streams. To continually summarize the distribution of such data, a highbiased set of quantiles (e.g., 50th, 90th and 99th perc...
Graham Cormode, Flip Korn, S. Muthukrishnan, Dives...