199 search results - page 28 / 40 » Fast Algorithms for Computing Tree LCS |
101
click to vote
EUROPAR
2008
Springer
15 years 1 months ago
2008
Springer
Chip multiprocessors designed for streaming applications such as Cell BE offer impressive peak performance but suffer from limited bandwidth to offchip main memory. As the number o...
102
Voted
RECOMB
2005
Springer
16 years 14 hour ago
2005
Springer
We describe a novel method for efficient reconstruction of phylogenetic trees, based on sequences of whole genomes or proteomes, whose lengths may greatly vary. The core of our me...
MOBIHOC
2006
ACM
15 years 11 months ago
2006
ACM
Tag identification is an important tool in RFID systems with applications for monitoring and tracking. A RFID reader recognizes tags through communication over a shared wireless c...
DAC
2006
ACM
15 years 3 months ago
2006
ACM
Conventionally, signal net routing is almost always implemented as Steiner trees. However, non-tree topology is often superior on timing performance as well as tolerance to open f...
113
click to vote
VLDB
1999
ACM
15 years 4 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...