Sciweavers

2661 search results - page 493 / 533
» Quantum Complexity Classes
Sort
View
132
Voted
FOCS
2006
IEEE
15 years 10 months ago
On the Compressibility of NP Instances and Cryptographic Applications
We study compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of NP decision problem...
Danny Harnik, Moni Naor
ICDCS
2006
IEEE
15 years 10 months ago
SysProf: Online Distributed Behavior Diagnosis through Fine-grain System Monitoring
Runtime monitoring is key to the effective management of enterprise and high performance applications. To deal with the complex behaviors of today’s multi-tier applications runn...
Sandip Agarwala, Karsten Schwan
ASPLOS
2006
ACM
15 years 9 months ago
Combinatorial sketching for finite programs
Sketching is a software synthesis approach where the programmer develops a partial implementation — a sketch — and a separate specification of the desired functionality. The ...
Armando Solar-Lezama, Liviu Tancau, Rastislav Bod&...
CASES
2006
ACM
15 years 9 months ago
Modeling heterogeneous SoCs with SystemC: a digital/MEMS case study
Designers of SoCs with non-digital components, such as analog or MEMS devices, can currently use high-level system design languages, such as SystemC, to model only the digital par...
Ankush Varma, Muhammad Yaqub Afridi, Akin Akturk, ...
PODC
2006
ACM
15 years 9 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah