140 search results - page 26 / 28 » Computing the Edit-Distance between Unrooted Ordered Trees |
PAM
2007
Springer
14 years 2 months ago
2007
Springer
The DNS root nameservers routinely use anycast in order to improve their service to clients and increase their resilience against various types of failures. We study DNS traffic co...
WWW
2005
ACM
14 years 9 months ago
2005
ACM
While the idea that querying mechanisms for complex relationships (otherwise known as Semantic Associations) should be integral to Semantic Web search technologies has recently ga...
SAC
2006
ACM
14 years 2 months ago
2006
ACM
Nowadays the concept of trust in computer communications starts to get more and more popular. While the idea of trust in human interaction seems to be obvious and understandable i...
TAMC
2007
Springer
14 years 2 months ago
2007
Springer
In previous work we have introduced an average-case measure for the time complexity of Boolean circuits – that is the delay between feeding the input bits into a circuit and the ...
RECOMB
2002
Springer
14 years 9 months ago
2002
Springer
The problem of characterizing and detecting recurrent sequence patterns such as substrings or motifs and related associations or rules is variously pursued in order to compress da...