3894 search results - page 212 / 779 » Approximation Algorithms for Biclustering Problems |
157
click to vote
SAT
2007
Springer
16 years 20 days ago
2007
Springer
Abstract. We consider the problem of computing tractable approximations to CNF formulas, extending the approach of Selman and Kautz to compute the Horn-LUB to involve renaming of v...
152
click to vote
NIPS
2007
15 years 8 months ago
2007
We present an efficient generalization of the sparse pseudo-input Gaussian process (SPGP) model developed by Snelson and Ghahramani [1], applying it to binary classification pro...
193
click to vote
ESANN
2006
15 years 8 months ago
2006
Abstract. We present the OnlineDoubleMaxMinOver approach to obtain the Support Vectors in two class classification problems. With its linear time complexity and linear convergence ...
186
click to vote
SDM
2008
SIAM
15 years 8 months ago
2008
SIAM
It has long been noted that many data mining algorithms can be built on top of join algorithms. This has lead to a wealth of recent work on efficiently supporting such joins with ...
171
click to vote
FOCS
2005
IEEE
16 years 4 days ago
2005
IEEE
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...