Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
— A new lossy compression method is proposed for haptic (force, velocity) data as exchanged in bilateral telepresence systems. The method is based on the passive extrapolative co...
Philipp Kremer, Martin Kuschel, Carsten Preusche, ...
The Distributed Probabilistic Protocol (DPP) is a new, approximate algorithm for solving Distributed Constraint Satisfaction Problems (DCSPs) that exploits prior knowledge to impr...
In open heterogeneous multi-agent systems, communication is hampered by lack of common ontologies. Ontologies may differ in naming conventions, granularity and scope. In such an en...
Jurriaan van Diggelen, Robbert-Jan Beun, Frank Dig...
Go is a strategic two player boardgame of Chinese origin. In terms of game theory, it is a deterministic perfect information game. But despite of these factors it is terribly comp...