3894 search results - page 176 / 779 » Approximation Algorithms for Biclustering Problems |
181
click to vote
COCO
2007
Springer
15 years 10 months ago
2007
Springer
We prove new results on the circuit complexity of Approximate Majority, which is the problem of computing Majority of a given bit string whose fraction of 1's is bounded away...
146
click to vote
SODA
2003
ACM
15 years 7 months ago
2003
ACM
We give a simple algorithm for the MINIMUM DIRECTED MULTICUT problem, and show that it gives an Ç´ÔÒµapproximation. This improves on the previous approximation guarantee of Ã...
178
click to vote
PPSN
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. The paper describes an evolutionary algorithm for the general nonlinear programming problem using a surrogate model. Surrogate models are used in optimization when model ...
174
click to vote
ICIP
2005
IEEE
16 years 8 months ago
2005
IEEE
In this paper the blind deconvolution problem is formulated using the variational framework. With its use approximations of the involved probability distributions are developed re...
158
click to vote
ECML
2004
Springer
15 years 12 months ago
2004
Springer
HEXQ is a reinforcement learning algorithm that discovers hierarchical structure automatically. The generated task hierarchy repthe problem at different levels of abstraction. In ...