1960 search results - page 24 / 392 » The Logic of Large Enough |
ICPADS
2005
IEEE
14 years 1 months ago
2005
IEEE
— The Distributed Spanning Tree (DST) is an overlay structure designed to be scalable. It supports the growth from small scale to large scale. The DST is a tree without bottlenec...
PLDI
2003
ACM
14 years 27 days ago
2003
ACM
d Abstract) Bruno Blanchet∗ § Patrick Cousot§ Radhia Cousot∗¶ J´erˆome Feret§ Laurent Mauborgne§ Antoine Min´e§ David Monniaux∗§ Xavier Rival§ that abstract inter...
CIKM
2009
Springer
13 years 11 months ago
2009
Springer
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
ASWEC
2001
IEEE
13 years 11 months ago
2001
IEEE
Static analysis is a tremendous help when trying to find faults in complex software. Writing multi-threaded programs is difficult, because the thread scheduling increases the prog...
LREC
2008
13 years 9 months ago
2008
We have analyzed the SPEX algorithm by Bernstein and Zobel (2004) for detecting co-derivative documents using duplicate n-grams. Although we totally agree with the claim that not ...