@inproceedings{15400, author = {{Labreuche, C. and Hüllermeier, Eyke and Vojtas, P. and Fallah Tehrani, A.}}, booktitle = {{in Proceedings DA2PL 2016 EURO Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn Germany}}, editor = {{Busa-Fekete, R. and Hüllermeier, Eyke and Mousseau, V. and Pfannschmidt, Karlson}}, title = {{{On the identifiability of models in multi-criteria preference learning}}}, year = {{2016}}, } @inproceedings{15401, author = {{Schäfer, D. and Hüllermeier, Eyke}}, booktitle = {{in Proceedings DA2PL`2016 Euro Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn, Germany}}, editor = {{Busa-Fekete, R. and Hüllermeier, Eyke and Mousseau, V. and Pfannschmidt, Karlson}}, title = {{{Preference -based reinforcement learning using dyad ranking}}}, year = {{2016}}, } @inproceedings{15402, author = {{Couso, Ines and Ahmadi Fahandar, Mohsen and Hüllermeier, Eyke}}, booktitle = {{in Proceedings DA2PL 2016 EURO Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn Germany}}, editor = {{Busa-Fekete, R. and Hüllermeier, Eyke and Mousseau, V. and Pfannschmidt, Karlson}}, title = {{{Statistical Inference for Incomplete Ranking Data: A Comparison of two likelihood-based estimators}}}, year = {{2016}}, } @inproceedings{15403, author = {{Lu, S. and Hüllermeier, Eyke}}, booktitle = {{in Proceedings 26th Workshop Computational Intelligence, Dortmund Germany}}, editor = {{Hüllermeier, Eyke and Hoffmann, F. and Mikut, R.}}, pages = {{1--8}}, publisher = {{KIT Scientific Publishing}}, title = {{{Support vector classification on noisy data using fuzzy superset losses}}}, year = {{2016}}, } @inproceedings{15404, author = {{Schäfer, D. and Hüllermeier, Eyke}}, booktitle = {{in Workshop LWDA "Lernen, Wissen, Daten, Analysen" Potsdam, Germany}}, title = {{{Plackett-Luce networks for dyad ranking}}}, year = {{2016}}, } @inproceedings{15435, author = {{Domik, Gitta}}, booktitle = {{Pedagogy Data Visualization, IEEE VIS Workshop}}, title = {{{A data visualization course at the university of paderborn}}}, year = {{2016}}, } @inproceedings{155, abstract = {{We present a self-stabilizing algorithm for overlay networks that, for an arbitrary metric given by a distance oracle, constructs the graph representing that metric. The graph representing a metric is the unique minimal undirected graph such that for any pair of nodes the length of a shortest path between the nodes corresponds to the distance between the nodes according to the metric. The algorithm works under both an asynchronous and a synchronous daemon. In the synchronous case, the algorithm stablizes in time O(n) and it is almost silent in that after stabilization a node sends and receives a constant number of messages per round.}}, author = {{Gmyr, Robert and Lefèvre, Jonas and Scheideler, Christian}}, booktitle = {{Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}}, pages = {{248----262}}, title = {{{Self-stabilizing Metric Graphs}}}, doi = {{10.1007/978-3-319-49259-9_20}}, year = {{2016}}, } @inproceedings{157, abstract = {{Consider a scheduling problem in which a set of jobs with interjob communication, canonically represented by a weighted tree, needs to be scheduled on m parallel processors interconnected by a shared communication channel. In each time step, we may allow any processed job to use a certain capacity of the channel in order to satisfy (parts of) its communication demands to adjacent jobs processed in parallel. The goal is to find a schedule that minimizes the makespan and in which communication demands of all jobs are satisfied.We show that this problem is NP-hard in the strong sense even if the number of processors and the maximum degree of the underlying tree is constant.Consequently, we design and analyze simple approximation algorithms with asymptotic approximation ratio 2-2/m in case of paths and a ratio of 5/2 in case of arbitrary trees.}}, author = {{König, Jürgen and Mäcker, Alexander and Meyer auf der Heide, Friedhelm and Riechers, Sören}}, booktitle = {{Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}}, pages = {{563----577}}, title = {{{Scheduling with Interjob Communication on Parallel Processors}}}, doi = {{10.1007/978-3-319-48749-6_41}}, year = {{2016}}, } @inproceedings{15873, author = {{Boschmann, Alexander and Agne, Andreas and Witschen, Linus Matthias and Thombansen, Georg and Kraus, Florian and Platzner, Marco}}, booktitle = {{2015 International Conference on ReConFigurable Computing and FPGAs (ReConFig)}}, isbn = {{9781467394062}}, keywords = {{Electromyography, Feature extraction, Delays, Hardware Pattern recognition, Prosthetics, High definition video}}, location = {{Mexiko City, Mexiko}}, publisher = {{IEEE}}, title = {{{FPGA-based acceleration of high density myoelectric signal processing}}}, doi = {{10.1109/reconfig.2015.7393312}}, year = {{2016}}, } @article{159, abstract = {{Abstract—Max-min fairness (MMF) is a widely known approachto a fair allocation of bandwidth to each of the usersin a network. This allocation can be computed by uniformlyraising the bandwidths of all users without violating capacityconstraints. We consider an extension of these allocations byraising the bandwidth with arbitrary and not necessarily uniformtime-depending velocities (allocation rates). These allocationsare used in a game-theoretic context for routing choices, whichwe formalize in progressive filling games (PFGs). We present avariety of results for equilibria in PFGs. We show that these gamespossess pure Nash and strong equilibria. While computation ingeneral is NP-hard, there are polynomial-time algorithms forprominent classes of Max-Min-Fair Games (MMFG), includingthe case when all users have the same source-destination pair.We characterize prices of anarchy and stability for pure Nashand strong equilibria in PFGs and MMFGs when players havedifferent or the same source-destination pairs. In addition, weshow that when a designer can adjust allocation rates, it is possibleto design games with optimal strong equilibria. Some initial resultson polynomial-time algorithms in this direction are also derived.}}, author = {{Harks, Tobias and Höfer, Martin and Schewior, Kevin and Skopalik, Alexander}}, journal = {{IEEE/ACM Transactions on Networking}}, number = {{4}}, pages = {{2553 -- 2562}}, publisher = {{IEEE}}, title = {{{Routing Games With Progressive Filling}}}, doi = {{10.1109/TNET.2015.2468571}}, year = {{2016}}, } @misc{146, author = {{Hamm, Julian}}, publisher = {{Universität Paderborn}}, title = {{{Symmetric Anonymous Credentials with Protocols for Relations on Attributes}}}, year = {{2016}}, } @inproceedings{14881, author = {{Chen, Wei-Fan and Ku, Lun-Wei}}, booktitle = {{Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics}}, pages = {{1635--1645}}, title = {{{UTCNN: a Deep Learning Model of Stance Classification on Social Media Text}}}, year = {{2016}}, } @inproceedings{14882, author = {{Chen, Wei-Fan and Lin, Fang-Yu and Ku, Lun-Wei}}, booktitle = {{Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: System Demonstrations}}, pages = {{273--277}}, title = {{{WordForce: Visualizing Controversial Words in Debates}}}, year = {{2016}}, } @inproceedings{14883, author = {{Ku, Lun-Wei and Chen, Wei-Fan}}, booktitle = {{Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Tutorial Abstracts}}, pages = {{5--8}}, title = {{{Chinese Textual Sentiment Analysis: Datasets, Resources and Tools}}}, year = {{2016}}, } @inproceedings{149, abstract = {{In this paper we consider a strategic variant of the online facility location problem. Given is a graph in which each node serves two roles: it is a strategic client stating requests as well as a potential location for a facility. In each time step one client states a request which induces private costs equal to the distance to the closest facility. Before serving, the clients may collectively decide to open new facilities, sharing the corresponding price. Instead of optimizing the global costs, each client acts selfishly. The prices of new facilities vary between nodes and also change over time, but are always bounded by some fixed value α. Both the requests as well as the facility prices are given by an online sequence and are not known in advance.We characterize the optimal strategies of the clients and analyze their overall performance in comparison to a centralized offline solution. If all players optimize their own competitiveness, the global performance of the system is O(√α⋅α) times worse than the offline optimum. A restriction to a natural subclass of strategies improves this result to O(α). We also show that for fixed facility costs, we can find strategies such that this bound further improves to O(√α).}}, author = {{Drees, Maximilian and Feldkord, Björn and Skopalik, Alexander}}, booktitle = {{Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}}, pages = {{593----607}}, title = {{{Strategic Online Facility Location}}}, doi = {{10.1007/978-3-319-48749-6_43}}, year = {{2016}}, } @phdthesis{150, author = {{Arifulina, Svetlana}}, publisher = {{Universität Paderborn}}, title = {{{Solving Heterogeneity for a Successful Service Market}}}, doi = {{10.17619/UNIPB/1-13}}, year = {{2016}}, } @inproceedings{15085, author = {{Dunst, Alexander and Hartel, Rita and Hohenstein, Sven and Laubrock, Jochen}}, booktitle = {{Digital Humanities 2016, DH 2016, Conference Abstracts}}, pages = {{178--180}}, title = {{{Corpus Analyses of Multimodal Narrative: The Example of Graphic Novels}}}, year = {{2016}}, } @inproceedings{15086, author = {{Böttcher, Stefan and Hartel, Rita and Jacobs, Thomas and Maneth, Sebastian}}, booktitle = {{2016 IEEE 32nd International Conference on Data Engineering (ICDE)}}, isbn = {{9781509020201}}, pages = {{1026--1037}}, publisher = {{IEEE}}, title = {{{Incremental updates on compressed XML}}}, doi = {{10.1109/icde.2016.7498310}}, year = {{2016}}, } @inproceedings{15111, author = {{Pfannschmidt, Karlson and Hüllermeier, Eyke and Held, S. and Neiger, R.}}, booktitle = {{In Proceedings IPMU 16th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, Part 1, Eindhoven, The Netherlands}}, pages = {{450--461}}, publisher = {{Springer}}, title = {{{Evaluating tests in medical diagnosis-Combining machine learning with game-theoretical concepts}}}, year = {{2016}}, } @inproceedings{15184, author = {{Dunst, Alexander and Hartel, Rita}}, booktitle = {{DHd-Tagung 2015, Modellierung - Vernetzung - Visualisierung, Die Digital Humanities als fächerübergreifendes Forschungsparadigma}}, title = {{{Die Corpusanalyse multimodaler Erzählungen am Beispiel graphischer Romane}}}, year = {{2016}}, }