Sciweavers

3228 search results - page 610 / 646
» Computationally Sound Proofs
Sort
View
PODS
2007
ACM
171views Database» more  PODS 2007»
14 years 8 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei
DCC
2006
IEEE
14 years 8 months ago
The B-coder: An Improved Binary Arithmetic Coder and Probability Estimator
In this paper we present the B-coder, an efficient binary arithmetic coder that performs extremely well on a wide range of data. The B-coder should be classed as an `approximate&#...
Benjamin Kelly, David F. Brailsford
MOBIHOC
2003
ACM
14 years 8 months ago
On the capacity improvement of ad hoc wireless networks using directional antennas
The capacity of ad hoc wireless networks is constrained by the interference between concurrent transmissions from neighboring nodes. Gupta and Kumar have shown that the capacity o...
Su Yi, Yong Pei, Shivkumar Kalyanaraman
POPL
2010
ACM
14 years 6 months ago
Dependent types and program equivalence
The definition of type equivalence is one of the most important design issues for any typed language. In dependentlytyped languages, because terms appear in types, this definition...
Jianzhou Zhao, Limin Jia, Stephanie Weirich, Vilhe...
ICS
2010
Tsinghua U.
14 years 6 months ago
Non-Malleable Codes
We introduce the notion of "non-malleable codes" which relaxes the notion of error-correction and errordetection. Informally, a code is non-malleable if the message cont...
Stefan Dziembowski, Krzysztof Pietrzak, Daniel Wic...