269 search results - page 45 / 54 » Optimal Randomized Algorithms for Local Sorting and Set-Maxi... |
ICAPR
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. This contribution shows how unsupervised Markovian segmentation techniques can be accelerated when implemented on graphics hardware equipped with a Graphics Processing Un...
VLDB
1999
ACM
13 years 11 months ago
1999
ACM
As random access memory gets cheaper, it becomes increasingly affordable to build computers with large main memories. We consider decision support workloads within the context of...
ALMOB
2006
13 years 7 months ago
2006
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...
BMCBI
2005
13 years 7 months ago
2005
Background: Dekapentagonal maps depict the phylogenetic relationships of five genomes in a visually appealing diagram and can be viewed as an alternative to a single evolutionary ...
INFOCOM
2000
IEEE
13 years 12 months ago
2000
IEEE
Abstract—In this paper, we present the implementation issues of a virtual backbone that supports the operations of the Uniform Quorum System (UQS) and the Randomized Database Gro...