Sciweavers

9359 search results - page 163 / 1872
» Generalization Algorithms for Second-Order Terms
Sort
View
CVPR
2012
IEEE
13 years 6 months ago
Bilevel sparse coding for coupled feature spaces
In this paper, we propose a bilevel sparse coding model for coupled feature spaces, where we aim to learn dictionaries for sparse modeling in both spaces while enforcing some desi...
Jianchao Yang, Zhaowen Wang, Zhe Lin, Xianbiao Shu...
STOC
2003
ACM
164views Algorithms» more  STOC 2003»
16 years 4 months ago
Approximate counting by dynamic programming
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
Martin E. Dyer
PODS
2006
ACM
107views Database» more  PODS 2006»
16 years 4 months ago
Programmable clustering
We initiate a novel study of clustering problems. Rather than specifying an explicit objective function to optimize, our framework allows the user of clustering algorithm to speci...
Sreenivas Gollapudi, Ravi Kumar, D. Sivakumar
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
15 years 8 months ago
gLINC: identifying composability using group perturbation
We present two novel perturbation-based linkage learning algorithms that extend LINC [5]; a version of LINC optimised for decomposition tasks (oLINC) and a hierarchical version of...
David Jonathan Coffin, Christopher D. Clack
TSP
2008
74views more  TSP 2008»
15 years 4 months ago
Performance of ESPRIT for Estimating Mixtures of Complex Exponentials Modulated by Polynomials
High Resolution (HR) methods are known to provide accurate frequency estimates for discrete spectra. The Polynomial Amplitude Complex Exponentials (PACE) model, also called quasipo...
Roland Badeau, Gaël Richard, Bertrand David