Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....
Eamonn J. Keogh, Kaushik Chakrabarti, Sharad Mehro...
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
The compression of polygonal mesh geometry is still an active field of research as in 3d no theoretical bounds are known. This work proposes a geometry coding method based on pred...