3894 search results - page 191 / 779 » Approximation Algorithms for Biclustering Problems |
175
click to vote
ICML
1999
IEEE
16 years 7 months ago
1999
IEEE
: Numerical function approximation over a Boolean domain is a classical problem with wide application to data modeling tasks and various forms of learning. A great many function ap...
179
click to vote
IJCAI
1997
15 years 7 months ago
1997
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
227
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
145
click to vote
NIPS
2003
15 years 7 months ago
2003
The maximisation of information transmission over noisy channels is a common, albeit generally computationally difficult problem. We approach the difficulty of computing the mutua...
294
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...