906 search results - page 70 / 182 » Matching Subsequences in Trees |
118
click to vote
ICMCS
2005
IEEE
15 years 9 months ago
2005
IEEE
Scalable shape encoding is an important requirement of highly scalable object-based video coding. In this paper, a new scalable vertex-based shape coding scheme is proposed that u...
141
click to vote
TCBB
2010
15 years 2 months ago
2010
— We present efficient cache-oblivious algorithms for some well-studied string problems in bioinformatics including the longest common subsequence, global pairwise sequence alig...
120
click to vote
ICCD
2006
IEEE
16 years 1 months ago
2006
IEEE
— New back-end design for manufacturability rules have brought guarantee rules for interconnect matching. These rules indicate a certain capacitance matching guarantee given spac...
143
click to vote
IPSN
2009
Springer
15 years 10 months ago
2009
Springer
We consider a scenario in which there are resources at or near nodes of a network, which are either static (e.g. fire stations, parking spots) or mobile (e.g. police cars). Over ...
145
click to vote
CIKM
2007
Springer
15 years 10 months ago
2007
Springer
Recently, due to its wide applications, subgraph search has attracted a lot of attention from database and data mining community. Sub-graph search is defined as follows: given a ...