7129 search results - page 949 / 1426 » Approximation Algorithms for Treewidth |
146
click to vote
CIKM
2011
Springer
14 years 4 months ago
2011
Springer
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...
181
click to vote
ESA
2011
Springer
14 years 4 months ago
2011
Springer
We present a number of positive and negative results for variants of the matroid secretary problem. Most notably, we design a constant-factor competitive algorithm for the “rando...
184
click to vote
CVPR
2012
IEEE
13 years 7 months ago
2012
IEEE
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...
152
click to vote
AAAI
2012
13 years 7 months ago
2012
We consider symbolic dynamic programming (SDP) for solving Markov Decision Processes (MDP) with factored state and action spaces, where both states and actions are described by se...
167
click to vote
ICIP
2007
IEEE
16 years 6 months ago
2007
IEEE
We introduce a new approach to image reconstruction from highly incomplete data. The available data are assumed to be a small collection of spectral coef?cients of an arbitrary li...