7015 search results - page 389 / 1403 » Approximation algorithms for co-clustering |
163
click to vote
CIKM
2010
Springer
15 years 5 months ago
2010
Springer
Pseudo-relevance feedback (PRF) improves search quality by expanding the query using terms from high-ranking documents from an initial retrieval. Although PRF can often result in ...
213
click to vote
TSP
2010
15 years 1 months ago
2010
Abstract--An efficient and flexible dictionary structure is proposed for sparse and redundant signal representation. The proposed sparse dictionary is based on a sparsity model of ...
187
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
We have studied two efficient sampling methods, Langevin and Hessian adapted Metropolis Hastings (MH), applied to a parameter estimation problem of the mathematical model (Lorent...
168
click to vote
APPROX
2004
Springer
16 years 6 days ago
2004
Springer
In many economic settings, convex figures on the plane are for sale. For example, one might want to sell advertising space on a newspaper page. Selfish agents must be motivated ...
177
click to vote
ATAL
2010
Springer
15 years 8 months ago
2010
Springer
In this paper we investigate an approach to provide approximate, anytime algorithms for DCOPs that can provide quality guarantees. At this aim, we propose the divide-and-coordinat...