Sciweavers

115
Voted
SOFSEM
2016
Springer
10 years 19 days ago
Lower Bounds for Online Bin Stretching with Several Bins
Online Bin Stretching is a semi-online variant of Bin Packing with a set number of m bins, where all bins can be overpacked to capacity S ≥ 1, which is to be minimized. There is ...
Martin Böhm
SOFSEM
2016
Springer
10 years 19 days ago
A Fast Order-Preserving Matching with q-neighborhood Filtration Using SIMD Instructions
The order-preserving matching problem is a variant of the pattern matching problem focusing on shapes of sequences instead of values of sequences. Given a text and a pattern, the p...
Yohei Ueki, Kazuyuki Narisawa, Ayumi Shinohara
SOFSEM
2016
Springer
10 years 19 days ago
OLAP Cube-based Graph Approach for Bibliographic Data
There is a growing number of different research fields that are concerned with bibliographic data analysis. In many cases, data of interest can be described as heterogeneous info...
Wararat Jakawat, Cécile Favre, Sabine Loudc...
SOFSEM
2016
Springer
10 years 19 days ago
Survey on Concern Separation in Service Integration
Abstract. Ever-changing business processes in large software systems, integration of heterogeneous data sources as well as the desire for legacy service integration drive software ...
Tomás Cerný, Michael J. Donahoo
129
Voted
SOFSEM
2016
Springer
10 years 19 days ago
A Natural Counting of Lambda Terms
We study the sequences of numbers corresponding to lambda terms of given sizes, where the size is this of lambda terms with de Bruijn
Maciej Bendkowski, Katarzyna Grygiel, Pierre Lesca...
SODA
2016
ACM
53views Algorithms» more  SODA 2016»
10 years 19 days ago
Raising The Bar For Vertex Cover: Fixed-parameter Tractability Above A Higher Guarantee
The standard parameterization of the VERTEX COVER problem (Given an undirected graph G and k ∈ N as input, does G have a vertex cover of size at most k?) has the solution size k...
Shivam Garg, Geevarghese Philip
SODA
2016
ACM
53views Algorithms» more  SODA 2016»
10 years 19 days ago
An Algorithmic Hypergraph Regularity Lemma
Szemer´edi’s Regularity Lemma [22, 23] is one of the most powerful tools in combinatorics. It asserts that all large graphs G admit a bounded partition of E(G), most classes of...
Brendan Nagle, Vojtech Rödl, Mathias Schacht
SODA
2016
ACM
53views Algorithms» more  SODA 2016»
10 years 19 days ago
Sampling on Lattices with Free Boundary Conditions Using Randomized Extensions
Many statistical physics models are defined on an infinite lattice by taking appropriate limits of finite lattice regions, where a key consideration is how the boundaries are d...
Sarah Cannon, Dana Randall
198
Voted
SODA
2016
ACM
60views Algorithms» more  SODA 2016»
10 years 19 days ago
Phase Transitions in Group Testing
The group testing problem consists of determining a sparse subset of a set of items that are “defective” based on a set of possibly noisy tests, and arises in areas such as me...
Jonathan Scarlett, Volkan Cevher