138 search results - page 2 / 28 » The Complexity of Quickly ORM-Decidable Sets |
WICON
2008
13 years 6 months ago
2008
It is well known that the maximum weighted independent set (MWIS) problem is NP-complete. Moreover, optimal scheduling in wireless networks requires solving a MWIS problem. Conseq...
EDM
2010
13 years 6 months ago
2010
While students' skill set profiles can be estimated with formal cognitive diagnosis models [8], their computational complexity makes simpler proxy skill estimates attractive [...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We present a method to compute, quickly and efficiently, the mutual information achieved by an IID (independent identically distributed) complex Gaussian input on a block Rayleigh-...
CPM
2008
Springer
13 years 6 months ago
2008
Springer
The Sort Transform (ST) can significantly speed up the block sorting phase of the Burrows-Wheeler transform (BWT) by sorting only limited order contexts. However, the best result o...
CVPR
2012
IEEE
11 years 7 months ago
2012
IEEE
In this paper, we tackle the problem of understanding the temporal structure of complex events in highly varying videos obtained from the Internet. Towards this goal, we utilize a...