7015 search results - page 98 / 1403 » Approximation algorithms for co-clustering |
ENTCS
2008
13 years 9 months ago
2008
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
RSCTC
2004
Springer
14 years 2 months ago
2004
Springer
A parallel rule-extracting algorithm based on the improved discernibility matrix [2] is proposed, by this way, a large amount of raw data can be divided into some small portions to...
ICML
2007
IEEE
14 years 10 months ago
2007
IEEE
We present a family of incremental Perceptron-like algorithms (PLAs) with margin in which both the "effective" learning rate, defined as the ratio of the learning rate t...
DCC
2004
IEEE
14 years 8 months ago
2004
IEEE
We present a new differential compression algorithm that combines the hash value techniques and suffix array techniques of previous work. Differential compression refers to encodi...
FOCS
2006
IEEE
14 years 3 months ago
2006
IEEE
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...