2001 search results - page 349 / 401 » An Update on Generalized Information Theory |
POPL
2003
ACM
14 years 9 months ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
MOBIHOC
2008
ACM
14 years 8 months ago
2008
ACM
Dealing with interference is one of the primary challenges to solve in the design of protocols for wireless ad-hoc networks. Most of the work in the literature assumes localized o...
WIKIS
2009
ACM
14 years 3 months ago
2009
ACM
Information Systems (IS) innovations are often characterized by buzzwords, reflecting organizing visions that structure and express the images and ideas formed by a wide community...
FOCS
2007
IEEE
14 years 3 months ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
CASES
2006
ACM
14 years 2 months ago
2006
ACM
The architectural design of embedded systems is becoming increasingly idiosyncratic to meet varying constraints regarding energy consumption, code size, and execution time. Tradit...