3894 search results - page 442 / 779 » Approximation Algorithms for Biclustering Problems |
177
click to vote
CIAC
2006
Springer
15 years 8 months ago
2006
Springer
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
125
click to vote
WSC
2008
15 years 7 months ago
2008
Reinforcement Learning (RL) is a simulation-based technique useful in solving Markov decision processes if their transition probabilities are not easily obtainable or if the probl...
121
Voted
WWW
2007
ACM
16 years 5 months ago
2007
ACM
We address the problem of measuring global quality metrics of search engines, like corpus size, index freshness, and density of duplicates in the corpus. The recently proposed est...
168
click to vote
ACM
1995
15 years 8 months ago
1995
We study properties of rough sets, that is, approximations to sets of records in a database or, more formally, to subsets of the universe of an information system. A rough set is a...
139
click to vote
PPSC
1997
15 years 6 months ago
1997
It seems likely that improvements in arithmetic speed will continue to outpace advances in communication bandwidth. Furthermore, as more and more problems are working on huge datas...