Sciweavers

126 search results - page 13 / 26
» Improved Approximation of Linear Threshold Functions
Sort
View
CORR
2011
Springer
168views Education» more  CORR 2011»
13 years 4 months ago
Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...
Abhimanyu Das, David Kempe
ICASSP
2009
IEEE
14 years 4 months ago
Extended VTS for noise-robust speech recognition
Model compensation is a standard way of improving the robustness of speech recognition systems to noise. A number of popular schemes are based on vector Taylor series (vts) compen...
Rogier C. van Dalen, Mark J. F. Gales
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
14 years 7 months ago
On linear and semidefinite programming relaxations for hypergraph matching
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Yuk Hei Chan, Lap Chi Lau
WSDM
2012
ACM
254views Data Mining» more  WSDM 2012»
12 years 5 months ago
Maximizing product adoption in social networks
One of the key objectives of viral marketing is to identify a small set of users in a social network, who when convinced to adopt a product will influence others in the network l...
Smriti Bhagat, Amit Goyal 0002, Laks V. S. Lakshma...
ICML
1999
IEEE
14 years 10 months ago
Least-Squares Temporal Difference Learning
Excerpted from: Boyan, Justin. Learning Evaluation Functions for Global Optimization. Ph.D. thesis, Carnegie Mellon University, August 1998. (Available as Technical Report CMU-CS-...
Justin A. Boyan