Sciweavers

1554 search results - page 203 / 311
» Parameterized Complexity and Approximation Algorithms
Sort
View
CIAC
2006
Springer
278views Algorithms» more  CIAC 2006»
15 years 7 months ago
Covering a Set of Points with a Minimum Number of Lines
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
Magdalene Grantson, Christos Levcopoulos
ICDAR
2007
IEEE
15 years 9 months ago
Robust Document Warping with Interpolated Vector Fields
This paper describes a new versatile algorithm for correcting nonlinear distortions, such as curvature of book pages, in camera based document processing. We introduce the idea of...
D. Schneider, Marco Block, Raúl Rojas
COMPGEOM
2005
ACM
15 years 5 months ago
Inequalities for the curvature of curves and surfaces
In this paper, we bound the difference between the total mean curvatures of two closed surfaces in R3 in terms of their total absolute curvatures and the Fr´echet distance betwee...
David Cohen-Steiner, Herbert Edelsbrunner
AAAI
1998
15 years 4 months ago
Which Search Problems Are Random?
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...
Tad Hogg
NIPS
2000
15 years 4 months ago
Learning Switching Linear Models of Human Motion
The human figure exhibits complex and rich dynamic behavior that is both nonlinear and time-varying. Effective models of human dynamics can be learned from motion capture data usi...
Vladimir Pavlovic, James M. Rehg, John MacCormick