248 search results - page 11 / 50 » Parameterized Algorithms for Directed Maximum Leaf Problems |
APPROX
2004
Springer
15 years 2 months ago
2004
Springer
We present a polynomial time 3/4-approximation algorithm for the maximum asymmetric TSP with weights zero and one. As applications, we get a 5/4-approximation algorithm for the (mi...
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
In this paper, the problem of estimating automatically the symmetry plane of bilateral objects (having perfect or imperfect mirror symmetry) in point clouds is reexamined. Classic...
82
Voted
ECCC
2006
14 years 9 months ago
2006
We present two new methods for finding a lowest common ancestor (LCA) for each pair of vertices of a directed acyclic graph (dag) on n vertices and m edges. The first method is su...
85
Voted
AUTOMATICA
2005
14 years 9 months ago
2005
This paper treats a new approach to the problem of periodic signal estimation. The idea is to model the periodic signal as a function of the state of a second-order nonlinear ordi...
90
Voted
ECIR
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. Machine learning ranking methods are increasingly applied to ranking tasks in information retrieval (IR). However ranking tasks in IR often differ from standard ranking t...