Sciweavers

2295 search results - page 380 / 459
» Learning Overcomplete Representations
Sort
View
FOCS
2003
IEEE
14 years 3 months ago
Proving Hard-Core Predicates Using List Decoding
We introduce a unifying framework for proving that predicate P is hard-core for a one-way function f, and apply it to a broad family of functions and predicates, reproving old res...
Adi Akavia, Shafi Goldwasser, Shmuel Safra
JASIS
2000
143views more  JASIS 2000»
13 years 9 months ago
Discovering knowledge from noisy databases using genetic programming
s In data mining, we emphasize the need for learning from huge, incomplete and imperfect data sets (Fayyad et al. 1996, Frawley et al. 1991, Piatetsky-Shapiro and Frawley, 1991). T...
Man Leung Wong, Kwong-Sak Leung, Jack C. Y. Cheng
IJON
1998
158views more  IJON 1998»
13 years 9 months ago
Bayesian Kullback Ying-Yang dependence reduction theory
Bayesian Kullback Ying—Yang dependence reduction system and theory is presented. Via stochastic approximation, implementable algorithms and criteria are given for parameter lear...
Lei Xu
GLOBECOM
2010
IEEE
13 years 8 months ago
Cognitive Network Inference through Bayesian Network Analysis
Cognitive networking deals with applying cognition to the entire network protocol stack for achieving stack-wide as well as network-wide performance goals, unlike cognitive radios ...
Giorgio Quer, Hemanth Meenakshisundaram, Tamma Bhe...
JMLR
2011
148views more  JMLR 2011»
13 years 5 months ago
Multitask Sparsity via Maximum Entropy Discrimination
A multitask learning framework is developed for discriminative classification and regression where multiple large-margin linear classifiers are estimated for different predictio...
Tony Jebara