Search
Results
-
-
Brief announcement: Hamming distance completeness and sparse matrix multiplication
(2018)Leibniz International Proceedings in Informatics (LIPIcs)We show that a broad class of (+, diamond) vector products (for binary integer functions diamond) are equivalent under one-to-polylog reductions to the computation of the Hamming distance. Examples include: the dominance product, the threshold product and l_{2p+1} distances for constant p. Our results imply equivalence (up to poly log n factors) between complexity of computation of All Pairs: Hamming Distances, l_{2p+1} Distances, Dominance ...Conference Paper -
Brief announcement: Energy constrained depth first search
(2018)Leibniz International Proceedings in Informatics (LIPIcs)Depth first search is a natural algorithmic technique for constructing a closed route that visits all vertices of a graph. The length of such route equals, in an edge-weighted tree, twice the total weight of all edges of the tree and this is asymptotically optimal over all exploration strategies. This paper considers a variant of such search strategies where the length of each route is bounded by a positive integer B (e.g. due to limited ...Conference Paper -
Selecting Sequences of Items via Submodular Maximization
(2017)Proceedings of the 31th AAAI Conference on Artificial Intelligence (AAAI'17)Conference Paper -
Aging-Aware Compiler-Directed VLIW Assignment for GPGPU Architectures
(2013)Proceedings of the 50th Annual Design Automation ConferenceConference Paper -
ARRIVAL: Next stop in CLS
(2018)Leibniz International Proceedings in Informatics (LIPIcs)We study the computational complexity of Arrival, a zero-player game on n-vertex switch graphs introduced by Dohrau, Gärtner, Kohler, Matousek, and Welzl. They showed that the problem of deciding termination of this game is contained in NP n coNP. Karthik C. S. recently introduced a search variant of Arrival and showed that it is in the complexity class PLS. In this work, we significantly improve the known upper bounds for both the decision ...Conference Paper -
The linear hidden subset problem for the (1+1) EA with scheduled and adaptive mutation rates
(2018)Proceedings of the 2018 Genetic and Evolutionary Computation Conference (GECCO)Conference Paper -
Medium step sizes are harmful for the compact genetic algorithm
(2018)Proceedings of the 2018 Genetic and Evolutionary Computation Conference (GECCO)Conference Paper -
RDSpeed: Development Framework for Speed-Based Adaptation of Web Content on Public Displays
(2018)Computer Science Research Notes CSRN ~ WSCG 2018 ProceedingsViewers of public displays perceive the content of a display at different walking speeds. While responsive design (RD) adapts web content to different viewing contexts, so far only the characteristics of the device and recently the proximity of the viewers are taken into account. Yet, little attention has been paid to speed-based adaption of content and its potential in case of public displays. We therefore decided to develop a framework ...Conference Paper -
Interference suppression in bandwidth hopping spread spectrum communications
(2018)Proceedings of the 11th ACM Conference on Security & Privacy in Wireless and Mobile NetworksConference Paper