We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
Ioannis Z. Emiris, Elias P. Tsigaridas, George M. ...
Abstract— We study the problem of registering local relative pose estimates to produce a global consistent trajectory of a moving robot. Traditionally, this problem has been stud...
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
There is considerable interest in computational methods to assist in the use of genetic polymorphism data for locating disease-related genes. Haplotypes, contiguous sets of correl...
Legacy program execution system, which is necessary for Grid to enable users to reuse all legacy programs without reengineering source codes, is still an open problem. We propose ...