SOFSEM
2016
Springer
8 years 8 days ago
2016
Springer
We present an evaluator for navigational XPath on Xml streams with projection. The idea is to project away those parts of an Xml stream that are irrelevant for evaluating a given X...
SOFSEM
2016
Springer
8 years 8 days ago
2016
Springer
Given a biconnected plane graph G and a nonnegative integer k, we examine the problem of deciding whether G admits a strict-orthogonal drawing (i.e., an orthogonal drawing without ...
SOFSEM
2016
Springer
8 years 8 days ago
2016
Springer
This paper addresses the low power mechanisms provided by the ZigBee and the 6LoWPAN Protocol, providing comparative assessments based on the results obtained by different researc...
SOFSEM
2016
Springer
8 years 8 days ago
2016
Springer
Multi-track string is an N-tuple strings of length n. For two multi-track strings T = (t1, t2, . . . , tN ) of length n and P = (p1, p2, ..., pM ) of length m, permuted pattern mat...
SOFSEM
2016
Springer
8 years 8 days ago
2016
Springer
Abstract. Let S be a string of length n with characters from an alphabet of size σ. The subsequence automaton (often called the directed acyclic subsequence graph) is the minimal ...
SOFSEM
2016
Springer
8 years 8 days ago
2016
Springer
Searching for an effective solution and creating a functional and affordable option of linking internal network while maintaining existing services and technologies, which implies ...
SOFSEM
2016
Springer
8 years 8 days ago
2016
Springer
Abstract. The research shows that maintenance of enterprise information systems consumes about 65-75% of the software development time and about 40-60% of maintenance efforts are ...
SOFSEM
2016
Springer
8 years 8 days ago
2016
Springer
SOFSEM
2016
Springer
8 years 8 days ago
2016
Springer
Abstract. With vast amounts of text being available in electronic format, such as news and social media, automatic multi-document summarization can help extract the most important ...
SOFSEM
2016
Springer
8 years 8 days ago
2016
Springer
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 ...