2069 search results - page 104 / 414 » Linear time algorithms for Clobber |
163
click to vote
SWAT
1994
Springer
15 years 8 months ago
1994
Springer
A graph is distance-hereditary if and only if each cycle on five or more vertices has at least two crossing chords. We present linear time algorithms for the minimum r-dominating c...
112
click to vote
AAAI
2000
15 years 5 months ago
2000
We introduce new linear time algorithms for satisfiability of binary propositional theories (2-SAT), and for recognition and satisfiability of renamable Horn theories. The algorit...
132
click to vote
IJCGA
2002
15 years 4 months ago
2002
This paper presents how the space of spheres and shelling may be used to delete a point from a d-dimensional triangulation efficiently. In dimension two, if k is the degree of the...
159
click to vote
LATA
2009
Springer
15 years 11 months ago
2009
Springer
The parameterized pattern matching problem is a kind of pattern matching problem, where a pattern is considered to occur in a text when there exists a renaming bijection on the alp...
134
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
This paper presents a new algorithm for the problem of robust subspace learning (RSL), i.e., the estimation of linear subspace parameters from a set of data points in the presence...