906 search results - page 26 / 182 » Matching Subsequences in Trees |
COMPSEC
2010
13 years 6 months ago
2010
Abstract A Secret Handshake is a protocol that allows two users to mutually verify one another’s properties, and in case of simultaneous matching, to share a key used to secure s...
DCC
2005
IEEE
14 years 7 months ago
2005
IEEE
Inspired by the combinatorial denoising method DUDE [13], we present efficient algorithms for implementing this idea for arbitrary contexts or for using it within subsequences. We...
LICS
2008
IEEE
14 years 2 months ago
2008
IEEE
This paper is an investigation of the matching problem for term equations s = t where s contains context variables, and both terms s and t are given using some kind of compressed ...
IPL
2008
13 years 7 months ago
2008
Abstract. In this paper, we study a restricted version of the position restricted pattern matching problem introduced and studied M
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
In data integration applications, a join matches elements that are common to two data sources. Often, however, elements are represented slightly different in each source, so an app...