Sciweavers

672 search results - page 118 / 135
» Almost Optimal Dispersers
Sort
View
FOCS
2000
IEEE
14 years 1 months ago
Extracting Randomness via Repeated Condensing
Extractors (defined by Nisan and Zuckerman) are procedures that use a small number of truly random bits (called the seed) to extract many (almost) truly random bits from arbitrar...
Omer Reingold, Ronen Shaltiel, Avi Wigderson
ISPD
2000
ACM
131views Hardware» more  ISPD 2000»
14 years 29 days ago
Multi-center congestion estimation and minimization during placement
As technology advances, more and more issues need to be considered in the placement stage, e.g., wirelength, congestion, timing, coupling. It is very hard to consider all of them ...
Maogang Wang, Xiaojian Yang, Kenneth Eguro, Majid ...
ICMCS
1997
IEEE
131views Multimedia» more  ICMCS 1997»
14 years 24 days ago
A Novel Video Layout Strategy for Near-Video-on-Demand Servers
Near-Video-on-Demand (NVOD) provides customers with a service model completely different from true Video-on-Demand (VOD). In the NVOD service model, customers’ requests are not ...
Shenze Chen, Manu Thapar
VLDB
1997
ACM
78views Database» more  VLDB 1997»
14 years 22 days ago
Recovering Information from Summary Data
Data is often stored in summarized form, as a histogram of aggregates (COUNTs, SUMs, or AVeraGes) over speci ed ranges. We study how to estimate the original detail data from the ...
Christos Faloutsos, H. V. Jagadish, Nikolaos Sidir...
ESA
2006
Springer
140views Algorithms» more  ESA 2006»
14 years 8 days ago
Latency Constrained Aggregation in Sensor Networks
A sensor network consists of sensing devices which may exchange data through wireless communication. A particular feature of sensor networks is that they are highly energy constrai...
Luca Becchetti, Peter Korteweg, Alberto Marchetti-...