199 search results - page 35 / 40 » Fast Algorithms for Computing Tree LCS |
176
click to vote
VLDB
2007
ACM
15 years 12 months ago
2007
ACM
As computer systems are essential components of many critical commercial services, the need for secure online transactions is now becoming evident. The demand for such application...
87
Voted
ECCB
2008
IEEE
15 years 1 months ago
2008
IEEE
Abstract. Mass spectrometry is among the most widely used technologies in proteomics and metabolomics. For metabolites, de novo interpretation of spectra is even more important tha...
108
click to vote
STOC
2000
ACM
15 years 4 months ago
2000
ACM
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
128
click to vote
CCGRID
2010
IEEE
14 years 9 months ago
2010
IEEE
Data-intensive parallel applications on clouds need to deploy large data sets from the cloud's storage facility to all compute nodes as fast as possible. Many multicast algori...
DAC
2006
ACM
16 years 17 days ago
2006
ACM
Steiner routing is a fundamental yet NP-hard problem in VLSI design and other research fields. In this paper, we propose to model the routing graph by an RC network with routing t...