Sciweavers

472 search results - page 48 / 95
» Limiting Negations in Formulas
Sort
View
TCC
2005
Springer
77views Cryptology» more  TCC 2005»
14 years 3 months ago
Upper and Lower Bounds on Black-Box Steganography
We study the limitations of steganography when the sender is not using any properties of the underlying channel beyond its entropy and the ability to sample from it. On the negati...
Nenad Dedic, Gene Itkis, Leonid Reyzin, Scott Russ...
DATE
2010
IEEE
121views Hardware» more  DATE 2010»
14 years 3 months ago
Using filesystem virtualization to avoid metadata bottlenecks
—Parallel file systems are very sensitive to adverse conditions, and the lack of synergy between such file systems and some of the applications running on them has a negative i...
Ernest Artiaga, Toni Cortes
WOLLIC
2010
Springer
14 years 3 months ago
On Anaphora and the Binding Principles in Categorial Grammar
In type logical categorial grammar the analysis of an expression is a resource-conscious proof. Anaphora represents a particular challenge to this approach in that the antecedent ...
Glyn Morrill, Oriol Valentín
INFOCOM
2000
IEEE
14 years 2 months ago
On the Aggregatability of Multicast Forwarding State
Abstract— It has been claimed that multicast state cannot be aggregated. In this paper, we will debunk this myth and present a simple technique that can be used to aggregate mult...
David Thaler, Mark Handley
DAC
1997
ACM
14 years 2 months ago
Equivalence Checking Using Cuts and Heaps
This paper presents a verification technique which is specifically targeted to formally comparing large combinational circuits with some structural similarities. The approach co...
Andreas Kuehlmann, Florian Krohm