2192 search results - page 73 / 439 » Algorithms for Challenging Motif Problems |
SIGMOD
2006
ACM
14 years 8 months ago
2006
ACM
Monitoring extreme values (MAX or MIN) is a fundamental problem in wireless sensor networks (and in general, complex dynamic systems). This problem presents very different algorit...
IPPS
1999
IEEE
14 years 13 days ago
1999
IEEE
The paper introduces a family of scheduling problems called fault-tolerant programs scheduling FTPS. Since FTPS problems are, in general, computationally di cult, a challenge is to...
AIPRF
2008
13 years 9 months ago
2008
Despite outstanding successes of the state-of-the-art clustering algorithms, many of them still suffer from shortcomings. Mainly, these algorithms do not capture coherency and homo...
PPOPP
1999
ACM
14 years 13 days ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
BCB
2010
13 years 3 months ago
2010
Biclustering is a very popular method to identify hidden co-regulation patterns among genes. There are numerous biclustering algorithms designed to undertake this challenging task...