906 search results - page 26 / 182 » Matching Subsequences in Trees |
127
Voted
COMPSEC
2010
15 years 2 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...
106
Voted
DCC
2005
IEEE
16 years 3 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...
116
Voted
LICS
2008
IEEE
15 years 10 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 ...
114
Voted
IPL
2008
15 years 3 months ago
2008
Abstract. In this paper, we study a restricted version of the position restricted pattern matching problem introduced and studied M
231
Voted
ICDE
2008
IEEE
16 years 5 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...