126
click to vote
CIAC
2006
Springer
15 years 7 months ago
2006
Springer
Let 1 and 0 be real numbers. A tree T = (V, E ) is a distance (, )
136
click to vote
CIAC
2006
Springer
15 years 7 months ago
2006
Springer
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed...
119
Voted
ECML
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We investigate the application of classification techniques to the problem of information extraction (IE). In particular we use support vector machines and several differ...
121
Voted
ECLIPSE
2004
ACM
15 years 7 months ago
2004
ACM
Object-oriented software development is a subject area difficult to teach, especially to beginners. They face a lot of abstraction and (from a beginners point of view) isolated to...
130
click to vote
CIAC
2006
Springer
15 years 7 months ago
2006
Springer
In this paper we construct two distributed algorithms for computing approximations of a largest matching and a minimum dominating set in planar graphs on n vertices. The approximat...