4541 search results - page 605 / 909 » Cache-Oblivious Algorithms and Data Structures |
178
click to vote
CONCUR
2007
Springer
16 years 1 months ago
2007
Springer
We present a fixpoint-based algorithm for context-sensitive interprocedural kill/gen-analysis of programs with thread creation. Our algorithm is precise up to abstraction of sync...
191
click to vote
SGAI
2007
Springer
16 years 1 months ago
2007
Springer
Novelty detection is a machine learning technique which identifies new or unknown information in large data sets. We present our current work on the construction of a new novelty...
190
click to vote
ESA
2003
Springer
16 years 12 days ago
2003
Springer
This paper presents a dynamic algorithm for the construction of the Euclidean Voronoi diagram of a set of convex objects in the plane. We consider first the Voronoi diagram of smo...
197
click to vote
RT
1998
Springer
15 years 11 months ago
1998
Springer
We propose a new method for greatly accelerating the computation of complex, detailed shadows in a radiosity solution. Radiosity is computed using a "standard" hierarchi...
191
click to vote
CIKM
2009
Springer
15 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...