Sciweavers

69 search results - page 11 / 14
» Discrete Random Variables over Domains
Sort
View
STOC
1991
ACM
84views Algorithms» more  STOC 1991»
15 years 5 months ago
Self-Testing/Correcting for Polynomials and for Approximate Functions
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld...
150
Voted
CDC
2008
IEEE
145views Control Systems» more  CDC 2008»
15 years 1 months ago
Necessary and sufficient conditions for success of the nuclear norm heuristic for rank minimization
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This c...
Benjamin Recht, Weiyu Xu, Babak Hassibi
UAI
2001
15 years 3 months ago
Hypothesis Management in Situation-Specific Network Construction
This paper considers the problem of knowledgebased model construction in the presence of uncertainty about the association of domain entities to random variables. Multi-entity Bay...
Kathryn B. Laskey, Suzanne M. Mahoney, Ed Wright
129
Voted
TSP
2010
14 years 8 months ago
Uplink synchronization in OFDMA spectrum-sharing systems
Spectrum sharing employs dynamic allocation of frequency resources for a more efficient use of the radio spectrum. Despite its appealing features, this technology inevitably compli...
Luca Sanguinetti, Michele Morelli, H. Vincent Poor
AAAI
2008
15 years 4 months ago
Hybrid Markov Logic Networks
Markov logic networks (MLNs) combine first-order logic and Markov networks, allowing us to handle the complexity and uncertainty of real-world problems in a single consistent fram...
Jue Wang, Pedro Domingos