Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,463,529 papers from all fields of science
Search
Sign In
Create Free Account
Partition refinement
In the design of algorithms, partition refinement is a technique for representing a partition of a set as a data structure that allows the partition…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
14 relations
Algorithm
Array data structure
Coffman–Graham algorithm
Cograph
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Crossing Reduction of Sankey Diagram with Barycentre Ordering via Markov Chain
Hechen Li
,
Shiying Li
,
Bowen Tan
,
Shuaicheng Li
arXiv.org
2019
Corpus ID: 209202386
Sankey diagram is popular for analyzing primary flows in network data. However, the growing complexity of data and hence…
Expand
2017
2017
A Coalgebraic Paige-Tarjan Algorithm
Ulrich Dorsch
,
Stefan Milius
,
Lutz Schröder
,
Thorsten Wißmann
arXiv.org
2017
Corpus ID: 125188768
We develop a coalgebraic generalization of the classical Paige-Tarjan algorithm for efficient bisimilarity checking. Coalgebraic…
Expand
2012
2012
Author ' s personal copy Interactive ontology revision
Nadeschda Nikitina
,
Sebastian Rudolph
,
Birte Glimmb
2012
Corpus ID: 39016197
When ontological knowledge is acquired automatically, quality control is essential. Which part of the automatically acquired…
Expand
2010
2010
Web Service Choreography Conformance Verification through the PIX-Model
Gregory van Seghbroeck
,
B. Volckaert
,
F. Turck
,
B. Dhoedt
,
P. Demeester
International Journal of Cooperative Information…
2010
Corpus ID: 14456257
As the adoption of the Service Oriented Architecture paradigm has dramatically increased over the past few years, proper…
Expand
2009
2009
ExpLOD : Exploring Interlinking and RDF Usage in the Linked Open Data Cloud
M. Consens
,
S. Khatchadourian
2009
Corpus ID: 16963979
The Linking Open Data community project is promoting the creation of interlinked RDF datasets with links between data items…
Expand
2009
2009
Representing and Querying Uncertain Data
Prithviraj Sen
2009
Corpus ID: 290900
There has been a longstanding interest in building systems that can handle uncertain data. Traditional database systems…
Expand
2005
2005
8 Image coding using redundant dictionaries
P. Vandergheynst
,
P. Frossard
2005
Corpus ID: 517086
This chapter discusses the problem of coding images using very redundant libraries of waveforms, also referred to as dictionaries…
Expand
Review
2002
Review
2002
Linearization in muCRL
Y. S. Usenko
2002
Corpus ID: 61704954
• A submitted manuscript is the version of the article upon submission and before peer-review. There can be important differences…
Expand
1999
1999
Supporting Design by Pattern-based Transformations
Ismaïl Khriss
,
R. Keller
,
I. A. Hamid
1999
Corpus ID: 9396800
Software development raises the need for traceability, i.e., the ability to control the consistency among software artifacts pr…
Expand
1996
1996
A Partition Reenement Algorithm for the -calculus ?
M. Pistore
,
D. Sangiorgi
1996
Corpus ID: 14192660
The partition reenement algorithm 10, 6] is the basis for most of the tools for checking bisimulation equivalences and for…
Expand