11231 search results - page 1944 / 2247 » Digging for Data Structures |
108
Voted
CICLING
2003
Springer
15 years 9 months ago
2003
Springer
We present an automatic method to disambiguate the senses of the near-synonyms in the entries of a dictionary of synonyms. We combine different indicators that take advantage of th...
145
Voted
ERSHOV
2003
Springer
15 years 9 months ago
2003
Springer
By obfuscation we mean any efficient semantic-preserving transformation of computer programs aimed at bringing a program into such a form, which impedes the understanding of its al...
133
Voted
ESA
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...
131
Voted
ESA
2003
Springer
15 years 9 months 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...
92
Voted
EUROPAR
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. Trees are useful data structures, but to design efficient parallel programs over trees is known to be more difficult than to do over lists. Although several important tre...