Sciweavers

4940 search results - page 320 / 988
» On the Complexity of Universal Programs
Sort
View
CISS
2008
IEEE
16 years 1 months ago
Near optimal lossy source coding and compression-based denoising via Markov chain Monte Carlo
— 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...
Shirin Jalali, Tsachy Weissman
SASO
2007
IEEE
16 years 28 days ago
On Scaling Multi-Agent Task Reallocation Using Market-Based Approach
Multi-agent systems (MAS) provide a promising technology for addressing problems such as search and rescue missions, mine sweeping, and surveillance. These problems are a form of ...
Rajesh K. Karmani, Timo Latvala, Gul Agha
SIGCOMM
2006
ACM
16 years 18 days ago
Jigsaw: solving the puzzle of enterprise 802.11 analysis
The combination of unlicensed spectrum, cheap wireless interfaces and the inherent convenience of untethered computing have made 802.11-based networks ubiquitous in the enterprise...
Yu-Chung Cheng, John Bellardo, Péter Benk&o...
FOCS
1999
IEEE
15 years 11 months ago
Limits on the Efficiency of One-Way Permutation-Based Hash Functions
Naor and Yung show that a one-bit-compressing universal one-way hash function (UOWHF) can be constructed based on a one-way permutation. This construction can be iterated to build...
Jeong Han Kim, Daniel R. Simon, Prasad Tetali
MSE
1999
IEEE
118views Hardware» more  MSE 1999»
15 years 11 months ago
Training IP Creators and Integrators
Intellectual property IP blocks are being created for reuse and marketed as a means of reducing the development time of complex designs. This in turn leads to a reduction in time ...
Donald W. Bouldin, Senthil Natarajan, Benjamin A. ...