Sciweavers

1389 search results - page 83 / 278
» Improved Approximation Algorithms for Label Cover Problems
Sort
View
ICASSP
2008
IEEE
15 years 9 months ago
A fast approximate joint diagonalization algorithm using a criterion with a block diagonal weight matrix
We propose a new algorithm for Approximate Joint Diagonalization (AJD) with two main advantages over existing state-of-the-art algorithms: Improved overall running speed, especial...
Petr Tichavský, Arie Yeredor, Jan Nielsen
TOMACS
2010
79views more  TOMACS 2010»
14 years 9 months ago
A stochastic approximation method with max-norm projections and its applications to the Q-learning algorithm
In this paper, we develop a stochastic approximation method to solve a monotone estimation problem and use this method to enhance the empirical performance of the Q-learning algor...
Sumit Kunnumkal, Huseyin Topaloglu
TMM
2010
270views Management» more  TMM 2010»
14 years 9 months ago
Sequence Multi-Labeling: A Unified Video Annotation Scheme With Spatial and Temporal Context
Abstract--Automatic video annotation is a challenging yet important problem for content-based video indexing and retrieval. In most existing works, annotation is formulated as a mu...
Yuanning Li, YongHong Tian, Ling-Yu Duan, Jingjing...
CORR
2011
Springer
168views Education» more  CORR 2011»
14 years 9 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
OPODIS
2008
15 years 4 months ago
Distributed Approximation of Cellular Coverage
Abstract. We consider the following model of cellular networks. Each base station has a given finite capacity, and each client has some demand and profit. A client can be covered b...
Boaz Patt-Shamir, Dror Rawitz, Gabriel Scalosub