43 search results - page 1 / 9 » A Generic Approach for Sparse Path Problems |
80
Voted
ICAART
2010
INSTICC
15 years 11 months ago
2010
INSTICC
137
Voted
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...
159
Voted
SMC
2010
IEEE
15 years 15 days 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...
127
Voted
ISPA
2005
Springer
15 years 8 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...
123
Voted
PKDD
2010
Springer
15 years 1 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...