Handling large amounts of data, such as large image databases, requires the use of approximate nearest neighbor search techniques. Recently, Hamming embedding methods such as spec...
We propose a modular framework for robust 3D reconstruction from unorganized, unoriented, noisy, and outlierridden geometric data. We gain robustness and scalability over previous...
Patrick Mullen, Fernando de Goes, Mathieu Desbrun,...
Given a genome, i.e., a long string over a fixed finite alphabet, the problem is to find short (dis)similar substrings. This computationally intensive task has many biological appl...
Hendrik Jan Hoogeboom, Walter A. Kosters, Jeroen F...
This paper proposes to use zooming function of digital cameras for robust character recognition and to control focal length for improving the performance even in dim light conditi...
The Vehicle Routing Problem with Time Windows involves finding the lowest-cost set of routes to deliver goods to customers, which have service time windows, using a homogeneous ...