43 search results - page 1 / 9 » A Generic Approach for Sparse Path Problems |
ICAART
2010
INSTICC
14 years 2 months ago
2010
INSTICC
ICIP
2009
IEEE
14 years 6 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...
SMC
2010
IEEE
13 years 2 months ago
2010
IEEE
Abstract--Finding the longest simple path in a generic undirected graph is a challenging issue that belongs to the NPComplete class of problems. Four approaches based on genetic al...
ISPA
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. With the help of distributed hash tables, the structured peerto-peer system has a short routing path and good extensibility. However, the mismatch between the overlay and...
PKDD
2010
Springer
13 years 3 months ago
2010
Springer
In this paper, we introduce a simple but efficient greedy algorithm, called SINCO, for the Sparse INverse COvariance selection problem, which is equivalent to learning a sparse Ga...