Sciweavers

157 search results - page 5 / 32
» Size space tradeoffs for resolution
Sort
View
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
14 years 8 months ago
Narrow proofs may be spacious: separating space and width in resolution
The width of a resolution proof is the maximal number of literals in any clause of the proof. The space of a proof is the maximal number of clauses kept in memory simultaneously if...
Jakob Nordström
CSL
2007
Springer
14 years 1 months ago
Game Characterizations and the PSPACE-Completeness of Tree Resolution Space
The Prover/Delayer game is a combinatorial game that can be used to prove upper and lower bounds on the size of Tree Resolution proofs, and also perfectly characterizes the space ...
Alexander Hertel, Alasdair Urquhart
CVPR
2011
IEEE
12 years 11 months ago
Space-Time Super-Resolution from a Single Video
Spatial Super Resolution (SR) aims to recover fine image details, smaller than a pixel size. Temporal SR aims to recover rapid dynamic events that occur faster than the video fra...
Oded Shahar, Alon Faktor, Michal Irani
ICPP
2002
IEEE
14 years 17 days ago
Optimal Code Size Reduction for Software-Pipelined Loops on DSP Applications
Code size expansion of software-pipelined loops is a critical problem for DSP systems with strict code size constraint. Some ad-hoc code size reduction techniques were used to try...
Qingfeng Zhuge, Zili Shao, Edwin Hsing-Mean Sha
ISCAS
2007
IEEE
105views Hardware» more  ISCAS 2007»
14 years 1 months ago
A Parallel, Multi-Resolution Sensing Technique for Multiple Antenna Cognitive Radios
—A parallel, multi-resolution spectrum sensing technique that is amenable to multiple-antenna cognitive radios is introduced. We show that for energy-detector-type spectrum senso...
Nathan M. Neihart, Sumit Roy, David J. Allstot