248 search results - page 12 / 50 » Parameterized Algorithms for Directed Maximum Leaf Problems |
AICCSA
2007
IEEE
15 years 3 months ago
2007
IEEE
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
WEA
2005
Springer
15 years 2 months ago
2005
Springer
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...
ISAAC
2000
Springer
15 years 1 months ago
2000
Springer
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a number m of machines, we study the problem of selecting a maximum weight subset of th...
DCG
2008
14 years 9 months ago
2008
We investigate algorithmic questions that arise in the statistical problem of computing lines or hyperplanes of maximum regression depth among a set of n points. We work primarily...
VTC
2006
IEEE
15 years 3 months ago
2006
IEEE
Abstract— This paper proposes a suboptimal maximum likelihood detection (MLD) algorithm for multiple-input multipleoutput (MIMO) communications. The proposed algorithm regards tr...