A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Sorting and Selection in Posets
[chapter]

2009
*
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
*

*In*particular, we present the first algorithm that

*sorts*a width-w

*poset*of size n with optimal query complexity O(n(w + log n)). ... Classical problems of

*sorting*

*and*searching assume an underlying linear ordering of the objects being compared. ...

*In*the classical

*sorting*

*and*

*selection*problems, w = 1. ...

##
###
Sorting and Selection in Posets

2011
*
SIAM journal on computing (Print)
*

*In*particular, we present the first algorithm that

*sorts*a width-w

*poset*of size n with optimal query complexity O(n(w + log n)). ... Classical problems of

*sorting*

*and*searching assume an underlying linear ordering of the objects being compared. ...

*In*the classical

*sorting*

*and*

*selection*problems, w = 1. ...

##
###
Sorting and Selection in Posets
[article]

2007
*
arXiv
*
pre-print

We present an algorithm that

arXiv:0707.1532v1
fatcat:abhu72hr2fa6lazvibbdjpp66e
*sorts*, i.e. completely identifies, a width w*poset*of size n*and*has query complexity O(wn + nlog(n)), which is within a constant factor of the information-theoretic lower ... Classical problems of*sorting**and*searching assume an underlying linear ordering of the objects being compared. ...*Sorting**and*k-*selection*The central computational problems of this paper are*sorting**and*k-*selection*. ...##
###
Small Complexity Gaps for Comparison-Based Sorting
[chapter]

2018
*
Lecture Notes in Computer Science
*

*In*their WADS2017 paper, Iwama

*and*Teruyama obtained a new upper bound for this constant, which improves the existing gap by some 25%. ...

*Sort*, the BinaryInsertion

*Sort*, etc. ... Recall that a majority of existing

*sorting*algorithms, including Bubble

*Sort*, Quick

*Sort*, Heap

*Sort*, Merge

*Sort*

*and*Insertion

*Sort*, are so-called comparisonbased

*sort*,

*in*which the input can be accessed ...

##
###
On the Complexity of Computing Winning Strategies for Finite Poset Games

2010
*
Theory of Computing Systems
*

We also show how to formalize the reasoning about

doi:10.1007/s00224-010-9254-y
fatcat:y5gcoqb225crvheofsd7gpicpi
*poset*games*in*Skelley's theory W 1 1 for PSPACE reasoning. ... We conclude that W 1 1 can use the "strategy stealing argument" to prove that*in**poset*games with a supremum the first player always has a winning strategy. ... This is*in*contrast to*poset*games, where any element x ∈ U can be*selected*on the first turn. ...##
###
Turkish keyphrase extraction using multi-criterion ranking

2009
*
2009 24th International Symposium on Computer and Information Sciences
*

Keyphrases have been extensively used for indexing

doi:10.1109/iscis.2009.5291825
dblp:conf/iscis/OzdemirC09
fatcat:ethtrbmcunactpglviuaayxyqq
*and*searching*in*databases*and*information retrieval systems.*In*addition, they provide useful information about semantic content of a document. ...*In*this paper, we propose an algorithm for automating Turkish keyphrase extraction. ... ACKNOWLEDGMENTS This work is partially supported by The Scientific*and*Technical Council of Turkey Grant "TUBITAK EEEAG-107E151". ...##
###
Exploring the Solution Space of Sorting by Reversals, with Experiments and an Application to Evolution

2008
*
IEEE/ACM Transactions on Computational Biology & Bioinformatics
*

*In*comparative genomics, algorithms that

*sort*permutations by reversals are often used to propose evolutionary scenarios of large-scale genomic mutations between species. ... The structure is a way to group solutions into equivalence classes,

*and*to identify

*in*each class one particular representative. ... ACKNOWLEDGMENTS This work is funded by the Agence Nationale pour la Recherche (ANR), project REGLIS NT05-3_45205,

*and*by the Action de Recherche Coopérative (ARC), project IBN, from the INRIA Institute ...

##
###
Producing posets

1981
*
Discrete Mathematics
*

FWther investigation is undertaken on an impontant class of pcse& called parti&~ns, wliich'includes all

doi:10.1016/0012-365x(81)90197-7
fatcat:c2hpi6rl3ffjpd2i5oab3n4koa
*selection*-iems treated*in*the literature. ... Many of the well-known seWion*and**sorting*pr&lems can be ur&qood as the pgduction of certain partial orders, using b+ry cornpar@ns. ihe paw discuses the complexity of the production of arbitrary pose& ... Many of the well-known*selection**and**sorting*problems can be understood as the production of certaiu part&l orders usin~'binqry comparisons. ...##
###
Towards Detection of Bottlenecks in Modular Systems
[article]

2013
*
arXiv
*
pre-print

points,

arXiv:1306.0128v1
fatcat:iirfn7yxnvcrvcnqhkrbtmjlmm
*and*/or multicriteria ranking), (2)*selection*of critical system elements (critical components/modules, critical component interconnection), (3)*selection*of interconnected system components as ... composite system faults (via clique-based fusion), (4) critical elements (e.g., nodes)*in*networks,*and*(5) predictive detection of system bottlenecks (detection of system components based on forecasting ... scale by elements*and*by compatibility N (S) 6a depicts the*poset*of system quality by components*and*Fig. 6b depicts an integrated*poset*with compatibility (each triangle corresponds to the*poset*...##
###
A framework for the study of preference incorporation in multiobjective evolutionary algorithms

2014
*
Proceedings of the 2014 conference on Genetic and evolutionary computation - GECCO '14
*

A number of properties

doi:10.1145/2576768.2598380
dblp:conf/gecco/IordacheIM14
fatcat:uor4t3xqgbgqrkijkffuml4rb4
*and*indicators are proposed for characterizing preference models. ... We will refer this property of a preference model as its*selectivity**and*we introduce the following 3*poset**selectivity*indicators: The dominance*poset*indicator Defined as the number of solutions that ... Intuitively, we can define the*selectivity*I sel pref of a preference model P with respect to a*poset**selectivity*indicator I sel*poset*as the average*poset**selectivity*value over the set of all non-dominated ...##
###
Entropic Uniform Sampling of Linear Extensions in Series-Parallel Posets
[chapter]

2017
*
Lecture Notes in Computer Science
*

*In*this paper, we introduce a uniform random sampler for linear extensions of Series-Parallel

*posets*. The algorithms we present ensure an essential property of random generation algorithms: entropy. ... They are

*in*a sense optimal

*in*their consumption of random bits. ... But another central property is the correspondence between the linear extensions of the

*poset*P

*and*the topological

*sorts*of Ψ pP q. Let P be a

*poset*,

*and*S " Ψ pP q be its associated SP DAG. ...

##
###
The Poset Cover Problem

2013
*
Open Journal of Discrete Mathematics
*

On the positive side, we explore the use of cover relations for finding

doi:10.4236/ojdm.2013.33020
fatcat:3qnualq7lnfhtbdobkywq2ua6m
*posets*that cover a set of linear orders*and*present a polynomial-time algorithm to find a partial*poset*cover. ... A partial order or*poset*. Here, we show that the decision version of this problem is NP-complete. ... (This follows from alternate choices available to the depth-first search used to construct a topological*sort*. See [41] .)*Select*a topological*sort*that makes . ...##
###
Description of posets critical with respect to the nonnegativity of the quadratic Tits form

2009
*
Ukrainian Mathematical Journal
*

42 ∼ = N op 98 , N 6,43 ∼ = N op 111 , N 6,44 ∼ = N op 91 , N 6,45 ∼ = N op 76 , N 6,46 ∼ = N 97 ,

doi:10.1007/s11253-009-0245-6
fatcat:v56ok6jiondftnu2xgjia7vu4y
*and*N 6,47 ∼ = N op 93 . ... To*select*a single*poset*from each class of isomorphic sets*in*the families of*posets*constructed*in*Steps I*and*II. ...*Posets*of this*sort*were studied*in*[6] [7] [8] [9] [10] [11] [12] [13] [14] . ...##
###
Geometric applications of posets

1998
*
Computational geometry
*

We show the power of

doi:10.1016/s0925-7721(98)00031-5
fatcat:hjlekzdfyfcxbbqlldpzy447dy
*posets**in*computational geometry by solving several problems posed on a set S ofn points*in*the plane: (1) find the n -k -1 rectilinear farthest neighbors (or, equivalently, k nearest ... B > 0, report all the pairs of points that belong to S*and*are of rectilinear distance ~ or more (less), covering k >7 n/2 points of S by rectilinear (4)*and*circular (5) concentric rings,*and*(6) given ... Given a set S of n points*in*the plane*and*a number k (n/2 <~ k <~ n), we can preprocess the points of S*in*O( (n -k) log (n -k ) ) time with O( (n -k) log (n -k ) ) space to answer*in*O(log (n -k ...##
###
Categorical skylines for streaming data

2008
*
Proceedings of the 2008 ACM SIGMOD international conference on Management of data - SIGMOD '08
*

*and*complexity. ... Additionally, our study of the dominance relation

*in*the dual space allows us to utilize geometric arrangements

*in*order to index the categorical skyline

*and*efficiently evaluate dominance queries. ... a

*poset*

*and*two possible topological

*sorts*. ...

« Previous

*Showing results 1 — 15 out of 2,016 results*