Sciweavers

903 search results - page 101 / 181
» On the reduction of a random basis
Sort
View
ICCAD
2008
IEEE
129views Hardware» more  ICCAD 2008»
16 years 3 months ago
A capacitance solver for incremental variation-aware extraction
Abstract—Lithographic limitations and manufacturing uncertainties are resulting in fabricated shapes on wafer that are topologically equivalent, but geometrically different from ...
Tarek A. El-Moselhy, Ibrahim M. Elfadel, Luca Dani...
CISS
2008
IEEE
16 years 22 days ago
1-Bit compressive sensing
Abstract—Compressive sensing is a new signal acquisition technology with the potential to reduce the number of measurements required to acquire signals that are sparse or compres...
Petros Boufounos, Richard G. Baraniuk
CDC
2009
IEEE
119views Control Systems» more  CDC 2009»
15 years 11 months ago
Resource sharing optimality in WiFi infrastructure networks
Abstract— In WiFi networks, mobile nodes compete for accessing a shared channel by means of a random access protocol called Distributed Coordination Function (DCF). Although this...
Laura Giarré, Giovanni Neglia, Ilenia Tinni...
COCO
2009
Springer
113views Algorithms» more  COCO 2009»
15 years 10 months ago
Extractors for Low-Weight Affine Sources
We give polynomial time computable extractors for low-weight affince sources. A distribution is affine if it samples a random points from some unknown low dimensional subspace of ...
Anup Rao
COLT
1991
Springer
15 years 9 months ago
Learning Probabilistic Read-Once Formulas on Product Distributions
Abstract. This paper presents a polynomial-time algorithm for inferring a probabilistic generalization of the class of read-once Boolean formulas over the usual basis {AND,OR,NOT}....
Robert E. Schapire