1282 search results - page 76 / 257 » Algorithms for Large, Sparse Network Alignment Problems |
107
click to vote
SWAT
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We study the gossiping problem in directed ad-hoc radio networks. Our main result is a deterministic algorithm that solves this problem in an n-node network in time O(n4/...
132
click to vote
ICIP
2009
IEEE
16 years 3 months ago
2009
IEEE
We propose a method to demosaick images acquired with a completely arbitrary color filter array (CFA). We adopt a variational approach where the reconstructed image has maximal sm...
110
click to vote
SIAMSC
2008
15 years 2 months ago
2008
The basis pursuit problem seeks a minimum one-norm solution of an underdetermined least-squares problem. Basis pursuit denoise (BPDN) fits the least-squares problem only approximat...
107
click to vote
CORR
2010
Springer
15 years 25 days ago
2010
Springer
We consider linear models for stochastic dynamics. To any such model can be associated a network (namely a directed graph) describing which degrees of freedom interact under the d...
126
click to vote
SIAMDM
2000
15 years 2 months ago
2000
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...