534 search results - page 53 / 107 » Power from Random Strings |
EMMCVPR
2001
Springer
14 years 2 months ago
2001
Springer
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...
WWW
2003
ACM
14 years 10 months ago
2003
ACM
The integration of data produced and collected across autonomous, heterogeneous web services is an increasingly important and challenging problem. Due to the lack of global identi...
SIGCOMM
2006
ACM
14 years 3 months ago
2006
ACM
There is a growing demand for network devices capable of examining the content of data packets in order to improve network security and provide application-specific services. Most...
MCU
1998
13 years 11 months ago
1998
The paper extends some of the most recently obtained results on the computational universality of speci c variants of H systems (e.g. with regular sets of rules) and proves that we...
BIRTHDAY
2010
Springer
13 years 11 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...