685 search results - page 36 / 137 » Closure Operators for Order Structures |
146
click to vote
LATIN
2010
Springer
15 years 8 months ago
2010
Springer
Binary relations are an important abstraction arising in a number of data representation problems. Each existing data structure specializes in the few basic operations required by ...
113
click to vote
ICALP
2010
Springer
15 years 6 months ago
2010
Springer
A data structure is presented for the Mergeable Dictionary abstract data type, which supports the following operations on a collection of disjoint sets of totally ordered data: Pr...
205
click to vote
AFPAC
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. Most of the processing in vision today uses spatially invariant operations. This gives efficient and compact computing structures, with the conventional convenient separa...
124
click to vote
WADS
2009
Springer
15 years 8 months ago
2009
Springer
The time required for a sequence of operations on a data structure is usually measured in terms of the worst possible such sequence. This, however, is often an overestimate of the ...
ESA
2007
Springer
15 years 8 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...