539 search results - page 49 / 108 » An Improved Upper Bound for SAT |
SODA
2010
ACM
13 years 6 months ago
2010
ACM
We give near-tight bounds for estimating the edit distance between two non-repetitive strings (Ulam distance) with constant approximation, in sub-linear time. For two strings of l...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
We prove two main results on how arbitrary linear threshold functions f(x) = sign(w · x − θ) over the n-dimensional Boolean hypercube can be approximated by simple threshold f...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
Abstract The 2-Interval Pattern problem is to find the largest constrained pattern in a set of 2-intervals. The constrained pattern is a subset of the given 2-intervals such that ...
HM
2010
Springer
13 years 7 months ago
2010
Springer
In this paper we consider solving a complex real life break scheduling problem. This problem of high practical relevance arises in many working areas, e.g. in air traffic control a...
CVRMED
1997
Springer
1997
Springer
Geometric constraint analysis and synthesis: methods for improving shape-based registration accuracy
13 years 11 months ago
Shape-based registration is a process for estimating the transformation between two shape representations of an object. It is used in many image-guided surgical systems to establis...