4,209 research outputs found
GPU accelerated maximum cardinality matching algorithms for bipartite graphs
We design, implement, and evaluate GPU-based algorithms for the maximum
cardinality matching problem in bipartite graphs. Such algorithms have a
variety of applications in computer science, scientific computing,
bioinformatics, and other areas. To the best of our knowledge, ours is the
first study which focuses on GPU implementation of the maximum cardinality
matching algorithms. We compare the proposed algorithms with serial and
multicore implementations from the literature on a large set of real-life
problems where in majority of the cases one of our GPU-accelerated algorithms
is demonstrated to be faster than both the sequential and multicore
implementations.Comment: 14 pages, 5 figure
Modelling word meaning using efficient tensor representations
Models of word meaning, built from a corpus of text, have demonstrated success in emulating human performance on a number of cognitive tasks. Many of these models use geometric representations of words to store semantic associations between words. Often word order information is not captured in these models. The lack of structural information used by these models has been raised as a weakness when performing cognitive tasks. This paper presents an efficient tensor based approach to modelling word meaning that builds on recent attempts to encode word order information, while providing flexible methods for extracting task specific semantic information
Matching on-the-fly in Sequential Experiments for Higher Power and Efficiency
We propose a dynamic allocation procedure that increases power and efficiency
when measuring an average treatment effect in sequential randomized trials.
Subjects arrive iteratively and are either randomized or paired via a matching
criterion to a previously randomized subject and administered the alternate
treatment. We develop estimators for the average treatment effect that combine
information from both the matched pairs and unmatched subjects as well as an
exact test. Simulations illustrate the method's higher efficiency and power
over competing allocation procedures in both controlled scenarios and
historical experimental data.Comment: 20 pages, 1 algorithm, 2 figures, 8 table
- …