1200 search results - page 21 / 240 » Marked Ancestor Problems |
AAECC
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. New algorithms are described and analysed for solving various problems associated with a large integer matrix: computing the Hermite form, computing a kernel basis, and s...
ICPR
2008
IEEE
14 years 4 months ago
2008
IEEE
A crucial preprocessing stage in applications such as OCR is text extraction from mixed-type documents. The present work, in contrast to most until now, successfully faces the pro...
ICALP
2011
Springer
13 years 1 months ago
2011
Springer
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
MATES
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. Cooperative problem solving without communication is an oftenstudied field within multi-agent research. Realistic problems investigated in this particular field are compl...
ANTSW
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation ...