Sciweavers

2354 search results - page 368 / 471
» Randomness, Stochasticity and Approximations
Sort
View
VLSID
2008
IEEE
153views VLSI» more  VLSID 2008»
16 years 6 months ago
Total Power Minimization in Glitch-Free CMOS Circuits Considering Process Variation
Compared to subthreshold leakage, dynamic power is normally much less sensitive to the process variation due to its approximately linear relation to the process parameters. Howeve...
Yuanlin Lu, Vishwani D. Agrawal
STOC
2007
ACM
106views Algorithms» more  STOC 2007»
16 years 6 months ago
One sketch for all: fast algorithms for compressed sensing
Compressed Sensing is a new paradigm for acquiring the compressible signals that arise in many applications. These signals can be approximated using an amount of information much ...
Anna C. Gilbert, Martin J. Strauss, Joel A. Tropp,...
ICASSP
2009
IEEE
16 years 19 days ago
Compressive sampling of pulse trains: Spread the spectrum!
In this paper we consider the problem of sampling far below the Nyquist rate signals that are sparse linear superpositions of shifts of a known, potentially wide-band, pulse. This...
Farid M. Naini, Rémi Gribonval, Laurent Jac...
INFOCOM
2009
IEEE
16 years 16 days ago
Absence of Evidence as Evidence of Absence: A Simple Mechanism for Scalable P2P Search
Abstract—We propose a novel search mechanism for unstructured p2p networks, and show that it is both scalable, i.e., it leads to a bounded query traffic load per peer as the pee...
Stratis Ioannidis, Peter Marbach
WINE
2009
Springer
140views Economy» more  WINE 2009»
16 years 15 days ago
Tighter Bounds for Facility Games
In one dimensional facility games, public facilities are placed based on the reported locations of the agents, where all the locations of agents and facilities are on a real line. ...
Pinyan Lu, Yajun Wang, Yuan Zhou