82 search results - page 12 / 17 » Randomized Decoding for Selection-and-Ordering Problems |
FOCS
1999
IEEE
14 years 5 days ago
1999
IEEE
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
DATE
2009
IEEE
14 years 2 months ago
2009
IEEE
— In this paper, we propose a novel, energy aware scheduling algorithm for applications running on DVS-enabled multiprocessor systems, which exploits variation in execution times...
CISS
2008
IEEE
14 years 2 months ago
2008
IEEE
— We propose an implementable new universal lossy source coding algorithm. The new algorithm utilizes two wellknown tools from statistical physics and computer science: Gibbs sam...
ICIP
2008
IEEE
14 years 2 months ago
2008
IEEE
This paper addresses the image representation problem in visual sensor networks. We propose a new image representation scheme based on compressive sensing (CS) because compressive...