100 search results - page 4 / 20 » Faster exponential time algorithms for the shortest vector p... |
WADS
2007
Springer
14 years 1 months ago
2007
Springer
In this paper, we give a O(log copt)-approximation algorithm for the point guard problem where copt is the optimal number of guards. Our algorithm runs in time polynomial in n, the...
WABI
2005
Springer
14 years 1 months ago
2005
Springer
Multiple Sequence Alignment (MSA) is one of the most fundamental problems in computational molecular biology. The running time of the best known scheme for finding an optimal ali...
VR
2003
IEEE
14 years 27 days ago
2003
IEEE
We present an experiment comparing double exponential smoothing and Kalman filter-based predictive tracking algorithms with derivative free measurement models. Our results show t...
AICCSA
2007
IEEE
14 years 2 months ago
2007
IEEE
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
ICCV
2007
IEEE
14 years 1 months ago
2007
IEEE
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...