We consider the problem of approximating a polygonal chain C by another polygonal chain C whose vertices are constrained to be a subset of the set of vertices of C. The goal is to ...
In benchmarking I/O systems, it is important to generate, accurately, the I/O access pattern that one is intending to generate. However, timing accuracy ( issuing I/Os at the desi...
Eric Anderson, Mahesh Kallahalla, Mustafa Uysal, R...
Biometric technologies are each time more demanded for security applications. In this sense, systems for identifying people are gaining popularity, especially in governmental sect...
We consider fast two-sided error-tolerant search that is robust against errors both on the query side (type alogrithm, find documents with algorithm) as well as on the document si...
Internet coordinate systems embed Round-Trip-Times (RTTs) between Internet nodes into some geometric space so that unmeasured RTTs can be estimated using distance computation in t...
Eng Keong Lua, Timothy G. Griffin, Marcelo Pias, H...