3875 search results - page 339 / 775 » Approximation algorithms for the 0-extension problem |
449
click to vote
ICA
2012
Springer
14 years 2 months ago
2012
Springer
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...
166
click to vote
STOC
2010
ACM
16 years 4 months ago
2010
ACM
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
208
click to vote
ICIP
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper we propose a novel algorithm for super resolution based on total variation prior and variational distribution approximations. We formulate the problem using a hierar...
201
click to vote
PERCOM
2010
ACM
15 years 5 months ago
2010
ACM
In this paper, we explore how to effectively create and use "instant mesh networks", i.e., wireless mesh networks that are dynamically deployed in temporary circumstances...
185
click to vote
PVLDB
2010
15 years 5 months ago
2010
Ranking is a fundamental operation in data analysis and decision support, and plays an even more crucial role if the dataset being explored exhibits uncertainty. This has led to m...