Sciweavers

2040 search results - page 342 / 408
» Approximate Expectation Maximization
Sort
View
109
Voted
CIKM
2011
Springer
14 years 24 days ago
Factorization-based lossless compression of inverted indices
Many large-scale Web applications that require ranked top-k retrieval are implemented using inverted indices. An inverted index represents a sparse term-document matrix, where non...
George Beskales, Marcus Fontoura, Maxim Gurevich, ...
INFOCOM
2012
IEEE
13 years 3 months ago
Submodular game for distributed application allocation in shared sensor networks
Abstract—Wireless sensor networks are evolving from singleapplication platforms towards an integrated infrastructure shared by multiple applications. Given the resource constrain...
Chengjie Wu, You Xu, Yixin Chen, Chenyang Lu
129
Voted
KDD
2012
ACM
187views Data Mining» more  KDD 2012»
13 years 3 months ago
Online learning to diversify from implicit feedback
In order to minimize redundancy and optimize coverage of multiple user interests, search engines and recommender systems aim to diversify their set of results. To date, these dive...
Karthik Raman, Pannaga Shivaswamy, Thorsten Joachi...
148
Voted
CVPR
2012
IEEE
13 years 3 months ago
Submodular dictionary learning for sparse coding
A greedy-based approach to learn a compact and discriminative dictionary for sparse representation is presented. We propose an objective function consisting of two components: ent...
Zhuolin Jiang, Guangxiao Zhang, Larry S. Davis
ICML
1996
IEEE
16 years 1 months ago
Learning Evaluation Functions for Large Acyclic Domains
Some of the most successful recent applications of reinforcement learning have used neural networks and the TD algorithm to learn evaluation functions. In this paper, we examine t...
Justin A. Boyan, Andrew W. Moore