Sciweavers

6142 search results - page 727 / 1229
» The Complexity of Partition Functions
Sort
View
APPROX
2007
Springer
104views Algorithms» more  APPROX 2007»
16 years 1 months ago
Worst-Case to Average-Case Reductions Revisited
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
Dan Gutfreund, Amnon Ta-Shma
VLSID
2006
IEEE
192views VLSI» more  VLSID 2006»
16 years 1 months ago
Beyond RTL: Advanced Digital System Design
This tutorial focuses on advanced techniques to cope with the complexity of designing modern digital chips which are complete systems often containing multiple processors, complex...
Shiv Tasker, Rishiyur S. Nikhil
ICDCS
2005
IEEE
16 years 19 days ago
Comparison of Approaches to Service Deployment
IT today is driven by the trend of increasing scale and complexity. Utility and Grid computing models, PlanetLab, and traditional data centers, are reaching the scale of thousands...
Vanish Talwar, Qinyi Wu, Calton Pu, Wenchang Yan, ...
ISVLSI
2005
IEEE
169views VLSI» more  ISVLSI 2005»
16 years 19 days ago
High Performance Array Processor for Video Decoding
high NRE cost. Therefore, general purpose programmable processors using software to perform various functions become more attractive since programmability can simplify system devel...
J. Lee, Narayanan Vijaykrishnan, Mary Jane Irwin
PODC
2003
ACM
16 years 8 days ago
Asynchronous resource discovery
Consider a dynamic, large-scale communication infrastructure (e.g., the Internet) where nodes (e.g., in a peer to peer system) can communicate only with nodes whose id (e.g., IP a...
Ittai Abraham, Danny Dolev