3894 search results - page 457 / 779 » Approximation Algorithms for Biclustering Problems |
114
Voted
CORR
2008
Springer
15 years 4 months ago
2008
Springer
The paper studies the problem of distributed static parameter (vector) estimation in sensor networks with nonlinear observation models and imperfect inter-sensor communication. We...
131
click to vote
ALMOB
2006
15 years 4 months ago
2006
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
152
click to vote
NIPS
1998
15 years 6 months ago
1998
A simple learning rule is derived, the VAPS algorithm, which can be instantiated to generate a wide range of new reinforcementlearning algorithms. These algorithms solve a number ...
127
Voted
ICPR
2008
IEEE
16 years 5 months ago
2008
IEEE
Considering the statistical text classification problem we approximate class-conditional probability distributions by structurally modified Poisson mixtures. By introducing the st...
155
click to vote
WAOA
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph colorin...