3894 search results - page 469 / 779 » Approximation Algorithms for Biclustering Problems |
151
Voted
IWPEC
2004
Springer
15 years 10 months ago
2004
Springer
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...
137
click to vote
COSIT
1995
Springer
15 years 8 months ago
1995
Springer
: Various algorithms have been proposed for the determination of the optimum paths in line networks. Moving in space is a far more complex problem, where research has been scarce. ...
140
click to vote
UAI
2008
15 years 6 months ago
2008
This paper describes a new algorithm to solve the decision making problem in Influence Diagrams based on algorithms for credal networks. Decision nodes are associated to imprecise...
127
Voted
IJCAI
2003
15 years 5 months ago
2003
We present a new algorithm, GM-Sarsa(0), for finding approximate solutions to multiple-goal reinforcement learning problems that are modeled as composite Markov decision processe...
130
click to vote
ICIP
2010
IEEE
15 years 2 months ago
2010
IEEE
This paper describes an optimization framework for reconstructing nonnegative image intensities from linear projections contaminated with Poisson noise. Such Poisson inverse probl...