Sciweavers

8 search results - page 2 / 2
» Polynomial kernels for Proper Interval Completion and relate...
Sort
View
COMBINATORICA
2008
89views more  COMBINATORICA 2008»
13 years 5 months ago
The stable set polytope of quasi-line graphs
It is a long standing open problem to find an explicit description of the stable set polytope of clawfree graphs. Yet more than 20 years after the discovery of a polynomial algori...
Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier St...
ALT
2006
Springer
14 years 2 months ago
Learning Linearly Separable Languages
This paper presents a novel paradigm for learning languages that consists of mapping strings to an appropriate high-dimensional feature space and learning a separating hyperplane i...
Leonid Kontorovich, Corinna Cortes, Mehryar Mohri
ESA
1995
Springer
182views Algorithms» more  ESA 1995»
13 years 9 months ago
A Geometric Approach to Betweenness
An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is specified to lie in...
Benny Chor, Madhu Sudan