Sciweavers

824 search results - page 24 / 165
» Weighted Low-Rank Approximations
Sort
View
JMLR
2012
11 years 11 months ago
Fast interior-point inference in high-dimensional sparse, penalized state-space models
We present an algorithm for fast posterior inference in penalized high-dimensional state-space models, suitable in the case where a few measurements are taken in each time step. W...
Eftychios A. Pnevmatikakis, Liam Paninski
RSKT
2010
Springer
13 years 6 months ago
Ordered Weighted Average Based Fuzzy Rough Sets
Traditionally, membership to the fuzzy-rough lower, resp. upper approximation is determined by looking only at the worst, resp. best performing object. Consequently, when applied t...
Chris Cornelis, Nele Verbiest, Richard Jensen
PODC
2009
ACM
14 years 9 months ago
Distributed and parallel algorithms for weighted vertex cover and other covering problems
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
Christos Koufogiannakis, Neal E. Young
STOC
2010
ACM
245views Algorithms» more  STOC 2010»
14 years 1 months ago
Weighted Geometric Set Cover via Quasi-Uniform Sampling
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...
Kasturi Varadarajan
ICPR
2010
IEEE
13 years 7 months ago
A Conductance Electrical Model for Representing and Matching Weighted Undirected Graphs
In this paper we propose a conductance electrical model to represent weighted undirected graphs that allows us to efficiently compute approximate graph isomorphism in large graph...
Manuel Igelmo, Alberto Sanfeliu, Miquel Ferrer