4536 search results - page 397 / 908 » Contention-Sensitive Data Structures and Algorithms |
154
click to vote
ESA
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. A lexicographic ranking function for the set of all permutations of n ordered symbols translates permutations to their ranks in the lexicographic order of all permutation...
139
click to vote
EMNLP
2006
15 years 8 months ago
2006
In this paper, we propose a sentence ordering algorithm using a semi-supervised sentence classification and historical ordering strategy. The classification is based on the manifo...
124
click to vote
SODA
2003
ACM
15 years 8 months ago
2003
ACM
We consider the problem of representing graphs compactly while supporting queries efficiently. In particular we describe a data structure for representing n-vertex unlabeled graph...
166
click to vote
SODA
2003
ACM
15 years 8 months ago
2003
ACM
Though Delaunay triangulations are very well known geometric data structures, the problem of the robust removal of a vertex in a three-dimensional Delaunay triangulation is still ...
175
Voted
IJCGA
2000
15 years 6 months ago
2000
We present e cient algorithms for several instances of the following facility location problem. Facilities and demand sites are represented as points in the plane. Place k obnoxio...