Sciweavers

Share
9 search results - page 1 / 2
» Tight Upper Bounds for Streett and Parity Complementation
Sort
View
CORR
2011
Springer
165views Education» more  CORR 2011»
8 years 2 months ago
Tight Upper Bounds for Streett and Parity Complementation
Complementation of finite automata on infinite words is not only a fundamental problem in automata theory, but also serves as a cornerstone for solving numerous decision problem...
Yang Cai, Ting Zhang
LICS
2009
IEEE
9 years 4 months ago
An Improved Lower Bound for the Complementation of Rabin Automata
Automata on infinite words (ω-automata) have wide applications in formal language theory as well as in modeling and verifying reactive systems. Complementation of ωautomata is ...
Yang Cai, Ting Zhang, Haifeng Luo
CORR
2010
Springer
130views Education» more  CORR 2010»
8 years 10 months ago
Sharp Bounds on the Entropy of the Poisson Law and Related Quantities
One of the difficulties in calculating the capacity of certain Poisson channels is that H(), the entropy of the Poisson distribution with mean , is not available in a simple form. ...
José A. Adell, Alberto Lekuona, Yaming Yu
AAAI
2010
8 years 11 months ago
Compilation Complexity of Common Voting Rules
In computational social choice, one important problem is to take the votes of a subelectorate (subset of the voters), and summarize them using a small number of bits. This needs t...
Lirong Xia, Vincent Conitzer
SODA
2001
ACM
115views Algorithms» more  SODA 2001»
8 years 11 months ago
Loss-bounded analysis for differentiated services
We consider a network providing Differentiated Services (DiffServ) which allow network service providers to offer different levels of Quality of Service (QoS) to different traffic...
Alexander Kesselman, Yishay Mansour
books