Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Andreas Hofmeier"'
Publikováno v:
Journal of Discrete Algorithms. 31:2-13
The rank aggregation problem consists in finding a consensus ranking on a set of alternatives, based on the preferences of individual voters. The alternatives are expressed by permutations, whose pairwise distance can be measured in many ways.In this
Publikováno v:
Journal of Combinatorial Optimization. 26:310-332
Comparing and ranking information is an important topic in social and information sciences, and in particular on the web. Its objective is to measure the difference of the preferences of voters on a set of candidates and to compute a consensus rankin
Autor:
Michael Stübert Berger, Andreas Hofmeier, Kamil Aliyev, Christoph Weidling, Alexander Schill, Klemens Muthmann, Daniel Schuster, Daniel Esser
Publikováno v:
ICDAR
Automatic information extraction from scanned business documents is especially valuable in the application domain of document archiving. But current systems for automated document processing still require a lot of configuration work that can only be
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642452772
IWOCA
IWOCA
The rank aggregation problem consists in finding a consensus ranking on a set of alternatives, based on the preferences of individual voters. These are expressed by permutations, whose distance can be measured in many ways.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ad1e46de54173e8f6a9a4294b1e89d05
https://doi.org/10.1007/978-3-642-45278-9_3
https://doi.org/10.1007/978-3-642-45278-9_3
Publikováno v:
WALCOM: Algorithms and Computation ISBN: 9783642280757
WALCOM
WALCOM
Comparing and ranking information is an important topic in social and information sciences, and in particular on the web. Its objective is to measure the difference of the preferences of voters on a set of candidates and to compute a consensus rankin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::265e24f5bf13c7834441b672e50fdc47
https://doi.org/10.1007/978-3-642-28076-4_11
https://doi.org/10.1007/978-3-642-28076-4_11
Publikováno v:
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management ISBN: 9783642212031
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7e058d4815e16f3398171434df463368
https://doi.org/10.1007/978-3-642-21204-8_37
https://doi.org/10.1007/978-3-642-21204-8_37
Autor:
Marco Matzeder, Andreas Hofmeier, Franz J. Brandenburg, Thomas Unfried, Wolfgang Brunner, Christian Bachmaier
Publikováno v:
Graph Drawing ISBN: 9783642002182
Graph Drawing
Graph Drawing
We consider straight-line drawings of trees on a hexagonal grid. The hexagonal grid is an extension of the common grid with inner nodes of degree six. We restrict the number of directions used for the edges from each node to its children from one to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cdc733f28328c7949eee30360860a680
https://doi.org/10.1007/978-3-642-00219-9_36
https://doi.org/10.1007/978-3-642-00219-9_36
Publikováno v:
Discrete Mathematics, Algorithms and Applications. :1360003
Comparing and ranking information is an important topic in social and information sciences, and in particular on the web. Its objective is to measure the difference of the preferences of voters on a set of candidates and to compute a consensus rankin