Sciweavers

1806 search results - page 334 / 362
» Some Functions Computable with a Fused-Mac
Sort
View
DAC
2002
ACM
14 years 9 months ago
Exploiting operation level parallelism through dynamically reconfigurable datapaths
Increasing non-recurring engineering (NRE) and mask costs are making it harder to turn to hardwired Application Specific Integrated Circuit (ASIC) solutions for high performance a...
Zhining Huang, Sharad Malik
MOBIHOC
2003
ACM
14 years 8 months ago
Energy-efficient caching strategies in ad hoc wireless networks
In this paper, we address the problem of energy-conscious cache placement in wireless ad hoc networks. We consider a network comprising a server with an interface to the wired net...
Pavan Nuggehalli, Vikram Srinivasan, Carla-Fabiana...
LICS
2008
IEEE
14 years 3 months ago
On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complexity
We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well a...
Søren Riis
SACI
2007
IEEE
14 years 2 months ago
Geometric Theory and Control of Linear Parameter Varying Systems
: Linear Parameter Varying(LPV) systems appear in a form of LTI state space representations where the elements of the A(ρ), B(ρ), C(ρ) matrices can depend on an unknown but at a...
Jozsef Bokor
APPROX
2007
Springer
104views Algorithms» more  APPROX 2007»
14 years 2 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