Sciweavers

5084 search results - page 72 / 1017
» Proving Possibility Properties
Sort
View
DCC
2005
IEEE
14 years 9 months ago
Efficient Alphabet Partitioning Algorithms for Low-Complexity Entropy Coding
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
Amir Said
FOCS
1998
IEEE
14 years 2 months ago
Jitter Control in QoS Networks
We study jitter control in networks with guaranteed quality of service (QoS) from the competitive analysis point of view: we propose on-line algorithms that control jitter and comp...
Yishay Mansour, Boaz Patt-Shamir
COLT
1992
Springer
14 years 2 months ago
On Learning Limiting Programs
Machine learning of limit programs (i.e., programs allowed finitely many mind changes about their legitimate outputs) for computable functions is studied. Learning of iterated lim...
John Case, Sanjay Jain, Arun Sharma
ASIAN
2006
Springer
116views Algorithms» more  ASIAN 2006»
14 years 1 months ago
Secrecy Analysis in Protocol Composition Logic
We present formal proof rules for inductive reasoning about the way that data transmitted on the network remains secret from a malicious attacker. Extending a compositional protoco...
Arnab Roy, Anupam Datta, Ante Derek, John C. Mitch...
JAIR
2006
85views more  JAIR 2006»
13 years 10 months ago
Causes of Ineradicable Spurious Predictions in Qualitative Simulation
It was recently proved that a sound and complete qualitative simulator does not exist, that is, as long as the input-output vocabulary of the state-of-the-art QSIM algorithm is us...
Özgür Yilmaz, A. C. Cem Say