Sciweavers

3495 search results - page 21 / 699
» On the random satisfiable process
Sort
View
IPPS
1998
IEEE
14 years 2 months ago
Sharing Random Bits with No Process Coordination
We present a method by which any polynomial-time randomized distributed algorithm is transformed in such way that each participating process needs only polylog local random bits a...
Marius Zimand
STOC
2007
ACM
106views Algorithms» more  STOC 2007»
14 years 10 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,...
ASPDAC
2007
ACM
92views Hardware» more  ASPDAC 2007»
14 years 2 months ago
New Block-Based Statistical Timing Analysis Approaches Without Moment Matching
With aggressive scaling down of feature sizes in VLSI fabrication, process variation has become a critical issue in designs. We show that two necessary conditions for the "Ma...
Ruiming Chen, Hai Zhou
NETWORKING
2000
13 years 11 months ago
Efficient Network Utilization for Multimedia Wireless Networks
In this paper, we present an access scheme to satisfy the QoS requirements for two classes of traffic during the contention phase of packet-switched wireless communications. In the...
Xin Liu, Edwin K. P. Chong, Ness B. Shroff
TIT
1998
50views more  TIT 1998»
13 years 10 months ago
Memory-Universal Prediction of Stationary Random Processes
Abstract— We consider the problem of one-step-ahead prediction of a real-valued, stationary, strongly mixing random process fXig
Dharmendra S. Modha, Elias Masry