3894 search results - page 691 / 779 » Approximation Algorithms for Biclustering Problems |
127
click to vote
OL
2007
15 years 2 months ago
2007
In this paper we construct the linear support vector machine (SVM) based on the nonlinear rescaling (NR) methodology (see [9, 11, 10] and references therein). The formulation of t...
152
click to vote
JAIR
2010
15 years 1 months ago
2010
Noisy probabilistic relational rules are a promising world model representation for several reasons. They are compact and generalize over world instantiations. They are usually in...
178
click to vote
ICDE
2011
IEEE
14 years 7 months ago
2011
IEEE
— Array database systems are architected for scientific and engineering applications. In these applications, the value of a cell is often imprecise and uncertain. There are at le...
173
click to vote
FGR
2011
IEEE
14 years 6 months ago
2011
IEEE
—An expression can be approximated by a sequence of temporal segments called neutral, onset, offset and apex. However, it is not easy to accurately detect such temporal segments ...
158
click to vote
SIGMOD
2001
ACM
16 years 3 months ago
2001
ACM
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...