Results 1  10
of
4,119
UnionFind with Constant Time Deletions
"... A unionfind data structure maintains a collection of disjoint sets under makeset, union and find operations. Kaplan, Shafrir and Tarjan [SODA 2002] designed data structures for an extension of the unionfind problem in which elements of the sets maintained may be deleted. The cost of a delete opera ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
A unionfind data structure maintains a collection of disjoint sets under makeset, union and find operations. Kaplan, Shafrir and Tarjan [SODA 2002] designed data structures for an extension of the unionfind problem in which elements of the sets maintained may be deleted. The cost of a delete
Paper: Vectorization of a statistical segmentation
, 2013
"... We propose an efficient vectorial implementation of a region merging segmentation algorithm. In this algorithm the merging order is based on edge value, and the merging predicate exploits recent statistical investigations. A notable acceleration is obtained by exploiting two forms of parallelism, fi ..."
Abstract
 Add to MetaCart
, firstly the Data Level Parallelism by processing edges of the same weight in parallel, secondly the Instruction Level Parallelism. Moreover, the classical UNIONFIND data structure is improved by using local registers to reduce the access time of FIND operations. Finally the implementation could be easily
Tabu Search  Part I
, 1989
"... This paper presents the fundamental principles underlying tabu search as a strategy for combinatorial optimization problems. Tabu search has achieved impressive practical successes in applications ranging from scheduling and computer channel balancing to cluster analysis and space planning, and more ..."
Abstract

Cited by 680 (11 self)
 Add to MetaCart
term memory processes for intensifying and diversifying the search. Included are illustrative data structures for implementing the tabu conditions (and associated aspiration criteria) that underlie these processes. Part I concludes with a discussion of probabilistic tabu search and a summary
Spacetime block codes from orthogonal designs
 IEEE Trans. Inform. Theory
, 1999
"... Abstract — We introduce space–time block coding, a new paradigm for communication over Rayleigh fading channels using multiple transmit antennas. Data is encoded using a space–time block code and the encoded data is split into � streams which are simultaneously transmitted using � transmit antennas. ..."
Abstract

Cited by 1524 (42 self)
 Add to MetaCart
Abstract — We introduce space–time block coding, a new paradigm for communication over Rayleigh fading channels using multiple transmit antennas. Data is encoded using a space–time block code and the encoded data is split into � streams which are simultaneously transmitted using � transmit antennas
Meldable Heaps and Boolean UnionFind (Extended Abstract)
, 2002
"... In the classical meldable heap data type we maintain an itemdisjoint collection of heaps under the operations findmin, insert, delete, decreasekey, and meld. In the usual definition decreasekey and delete get the item and the heap containing it as parameters. We consider the modified problem whe ..."
Abstract
 Add to MetaCart
In the classical meldable heap data type we maintain an itemdisjoint collection of heaps under the operations findmin, insert, delete, decreasekey, and meld. In the usual definition decreasekey and delete get the item and the heap containing it as parameters. We consider the modified problem
UnionFind With Deletions
, 2002
"... In the classical unionfind problem we maintain a partition of a universe of n elements into disjoint sets subject to the operations union and find. The operation union(A; B;C) replaces sets A and B in the partition by their union, given the name C. The operation find(x) returns the name of the set ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
In the classical unionfind problem we maintain a partition of a universe of n elements into disjoint sets subject to the operations union and find. The operation union(A; B;C) replaces sets A and B in the partition by their union, given the name C. The operation find(x) returns the name of the set
Unionfind volume segmentation
 In 7th International Workshop on Combinatorial Image Analysis (IWCIA'00), pp 181197
, 2000
"... We present an efficient method to segment large 3d images that takes the whole 3dimensional structure into account. We use a UnionFind data structure to record and maintain the necessary informations during the segmentation process. This structure leads to a volume labelling and facilitates intera ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present an efficient method to segment large 3d images that takes the whole 3dimensional structure into account. We use a UnionFind data structure to record and maintain the necessary informations during the segmentation process. This structure leads to a volume labelling and facilitates
CLASSIC: A Structural Data Model for Objects
, 1989
"... CLASSIC is a data model that encourages the description ofobjects not only in terms of their relations to other known objects, but in terms of a level of intensional structure as well. The CLASSIC language of structured descriptions permits i) partial descriptions of individuals, under an `open worl ..."
Abstract

Cited by 369 (26 self)
 Add to MetaCart
CLASSIC is a data model that encourages the description ofobjects not only in terms of their relations to other known objects, but in terms of a level of intensional structure as well. The CLASSIC language of structured descriptions permits i) partial descriptions of individuals, under an `open
Experiments on UnionFind Algorithms for the DisjointSet Data Structure
"... Abstract. The disjointset data structure is used to maintain a collection of nonoverlapping sets of elements from a finite universe. Algorithms that operate on this data structure are often referred to as UnionFind algorithms. They are used in numerous practical applications and are also availabl ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
Abstract. The disjointset data structure is used to maintain a collection of nonoverlapping sets of elements from a finite universe. Algorithms that operate on this data structure are often referred to as UnionFind algorithms. They are used in numerous practical applications and are also
A Persistent UnionFind Data Structure
"... Abstract The problem of disjoint sets, also known as unionfind, consistsin maintaining a partition of a finite set within a data structure. ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
Abstract The problem of disjoint sets, also known as unionfind, consistsin maintaining a partition of a finite set within a data structure.
Results 1  10
of
4,119