152 search results - page 20 / 31 » Tetris is Hard, Even to Approximate |
SPAA
2010
ACM
13 years 7 months ago
2010
ACM
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
CIVR
2009
Springer
14 years 2 months ago
2009
Springer
The Bag of Visual Words (BoV) paradigm has successfully been applied to image content analysis tasks such as image classification and object detection. The basic BoV approach ove...
STOC
2007
ACM
14 years 7 months ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
WISEC
2009
ACM
14 years 2 months ago
2009
ACM
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
Stereo matching commonly requires rectified images that
are computed from calibrated cameras. Since all under-
lying parametric camera models are only approximations,
calibratio...