Compact Representations of Ordered Sets

COMPACT REPRESENTATIONS OF ORDERED SETS. ∗. Daniel K. Blandford [email protected] ... A split operation is one that, given an ordered set S and a value v, splits the ...

Compact representations of ordered sets - ACM Digital Library

Given any ordered dictionary structure (or comparison-based ordered set structure) D that uses O(n) pointers, we demonstrate a simple blocking technique that ...

Compact Representations of Ordered Sets - KiltHub

We consider the problem of efficiently representing sets S of size n from an ordered universe U = {0,...,m-1}. Given any ordered dictionary structure (or ...

Well-ordered set with greatest element is compact

Let X be a well-ordered set with a greatest element α. We consider all sets of the form ]x,y] where y∈X and x is either another element of X or the symbol ←.

Compact representations of ordered sets. - dblp

Daniel K. Blandford, Guy E. Blelloch: Compact representations of ordered sets. SODA 2004: 11-19. manage site settings. To protect your privacy, all features ...

Compact Set Representation for Information Retrieval - CiteSeerX

These queries can be reduced to the problem of intersecting ordered sets of integers, where each set represents the documents containing one of the query terms.

Compact Representation of Biological Sequences Using Set ...

The set decision diagrams are an extension of the reduced ordered binary decision diagrams, a graph data structure used as a symbolic compact representation of ...

Compact Representation - an overview | ScienceDirect Topics

Compact representation refers to a concise and efficient way of describing constraints within clauses in a Constraint Logic Programming (CLP) language.

Compact Representations of State Sets in State Space Search

More specifically, the project investigates compact state set representations for an A* state space search's closed- and open lists. It was ...

Chapter 8 Ordered Sets

A space is called -compact if can be written as a countable union of compact sets. ... We complete the proof by showing that such a representation for is.

Compact Representation of Posets | Request PDF - ResearchGate

... Te discipline of space-efcient data structures for partially ordered sets or posets has been intensively studied. A poset with n elements can be represented ...

Ordered Sets for Data Analysis - arXiv

Dushnik-Miller theorem gives a representation of a partial order through intersections of linear orders. ... sets is contained in a small set. This heuristic does ...

Compact Set Representation for Information Retrieval - SpringerLink

In this paper we evaluate intersection algorithms on compressed sets, comparing them to the best non-sequential array-based intersection algorithms. By adding a ...

Compact generation in partially ordered sets | Cambridge Core

A similar representation theorem holds for algebraic posets; it is known that every algebraic poset is isomorphic to the system i(Q) of all directed lower sets ...

Ordered Sets and Duality for Distributive Lattices - ScienceDirect.com

An account is given of the categorical duality which exists between bounded distributive lattices and compact totally order disconnected spaces.

ORDERED SETS

The proof that STTC is compact is similar to that of Lemma 7, p. 116, of ... 1956] REPRESENTATION THEOREMS FOR PARTIALLY ORDERED SETS 593 ideals Ja and ...

(PDF) On Scattered Compact Ordered Sets - ResearchGate

PDF | A compact ordered set $K$ enjoys the property that every continuous real function on $K$ is a sum of its increments if and only if $K$ is scattered.

Tube Representations of Ordered Sets - Willamette University

The classes of tube orders for small values of n, i, and f an unknown relation. There are clearly an infinite number of classes of tube orders; we include ...

Topology on Semi-Well Ordered Sets

A well ordered set with order topology is compact if and only if it has the greatest element. But a semi-well-ordered set need not be compact, ...

A compact representation for minimizers of k-submodular functions

Minimizers of a submodular function form a distributive lattice, and are compactly rep- resented by a poset (partially ordered set) via Birkhoff ...