686 search results - page 97 / 138 » On the General Applicability of Instruction-Set Randomizatio... |
IPPS
1999
IEEE
14 years 29 days ago
1999
IEEE
Abstract. In recent years, there has been a surge of interest in Javabased volunteer computing systems, which aim to make it possible to build very large parallel computing network...
GD
1998
Springer
14 years 27 days ago
1998
Springer
We consider the problem of visualizing interconnections in railway systems. Given time tables from systems with thousands of trains, we are to visualize basic properties of the co...
SPAA
1994
ACM
14 years 22 days ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
CIKM
2009
Springer
14 years 18 days 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...
CIKM
2009
Springer
14 years 18 days ago
2009
Springer
The highly variable and dynamic word usage in social media presents serious challenges for both research and those commercial applications that are geared towards blogs or other u...