Sciweavers

5785 search results - page 872 / 1157
» Approximability of Probability Distributions
Sort
View
130
Voted
INFOCOM
2000
IEEE
15 years 9 months ago
Broadcast Disks with Polynomial Cost Functions
— In broadcast disk systems, information is broadcasted in a shared medium. When a client needs an item from the disk, it waits until that item is broadcasted. The fundamental al...
Amotz Bar-Noy, Boaz Patt-Shamir, Igor Ziper
ISCC
2000
IEEE
156views Communications» more  ISCC 2000»
15 years 9 months ago
Inverse Multiplexing for ATM. Technical Operation, Applications and Performance Evaluation Study
-- In a WAN established infrastructure, one of the main problems ATM network planners and users face, when greater than T1/E1 bandwidth is required, is the high cost associated to ...
Marcos Postigo-Boix, Mónica Aguilar-Igartua...
170
Voted
FOCS
1999
IEEE
15 years 9 months ago
Near-Optimal Conversion of Hardness into Pseudo-Randomness
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
FCCM
1998
IEEE
169views VLSI» more  FCCM 1998»
15 years 9 months ago
Scalable Network Based FPGA Accelerators for an Automatic Target Recognition Application
Abstract Image processing, specifically Automatic Target Recognition (ATR) in Synthetic Aperture Radar (SAR) imagery, is an application area that can require tremendous processing ...
Ruth Sivilotti, Young Cho, Wen-King Su, Danny Cohe...
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
15 years 9 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass