Sciweavers

477 search results - page 48 / 96
» Complexity Considerations, cSAT Problem Lower Bound
Sort
View
SIGMETRICS
2005
ACM
118views Hardware» more  SIGMETRICS 2005»
14 years 2 months ago
Nearly insensitive bounds on SMART scheduling
We define the class of SMART scheduling policies. These are policies that bias towards jobs with small remaining service times, jobs with small original sizes, or both, with the ...
Adam Wierman, Mor Harchol-Balter, Takayuki Osogami
TSP
2008
69views more  TSP 2008»
13 years 8 months ago
A Frame Construction and a Universal Distortion Bound for Sparse Representations
Abstract-- We consider approximations of signals by the elements of a frame in a complex vector space of dimension N and formulate both the noiseless and the noisy sparse represent...
Mehmet Akçakaya, Vahid Tarokh
STOC
2007
ACM
137views Algorithms» more  STOC 2007»
14 years 9 months ago
Testing k-wise and almost k-wise independence
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Ma...
ICC
2007
IEEE
107views Communications» more  ICC 2007»
14 years 3 months ago
Error Floors of LDPC Coded BICM
Abstract— In recent years performance prediction for communication systems utilizing iteratively decodable codes has been of considerable interest. There have been significant b...
Aditya Ramamoorthy, Nedeljko Varnica
CVPR
2011
IEEE
13 years 5 months ago
Multi-Level Inference by Relaxed Dual Decomposition for Human Pose Segmentation
Combining information from the higher level and the lower level has long been recognized as an essential component in holistic image understanding. However, an efficient inferenc...
Huayan Wang, Daphne Koller