Sciweavers

157 search results - page 1 / 32
» Size space tradeoffs for resolution
Sort
View
STOC
2002
ACM
101views Algorithms» more  STOC 2002»
14 years 5 months ago
Size space tradeoffs for resolution
We investigate tradeoffs of various basic complexity measures such as size, space and width. We show examples of formulas that have optimal proofs with respect to any one of these...
Eli Ben-Sasson
STOC
2012
ACM
196views Algorithms» more  STOC 2012»
11 years 7 months ago
Time-space tradeoffs in resolution: superpolynomial lower bounds for superlinear space
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...
Paul Beame, Christopher Beck, Russell Impagliazzo
ICIP
2006
IEEE
14 years 6 months ago
Subjective Image Quality Tradeoffs Between Spatial Resolution and Quantization Noise
The importance of tradeoffs between spatial resolution and quantization noise has been examined in our previous work. Subjective experiments indicate that as the bitrate decreases...
Soo Hyun Bae, Thrasyvoulos N. Pappas, Biing-Hwang ...
CJ
2002
67views more  CJ 2002»
13 years 4 months ago
Using Bloom Filters to Speed-up Name Lookup in Distributed Systems
Bloom filters make use of a "probabilistic" hash-coding method to reduce the amount of space required to store a hash set. A Bloom filter offers a trade-off between its ...
Mark C. Little, Santosh K. Shrivastava, Neil A. Sp...
IPL
2002
107views more  IPL 2002»
13 years 4 months ago
Binary space partitions for axis-parallel line segments: Size-height tradeoffs
We present worst-case lower bounds on the minimum size of a binary space partition (BSP) tree as a function of its height, for a set S of n axis-parallel line segments in the plan...
Sunil Arya