522 search results - page 43 / 105 » The 3-Steiner Root Problem |
CTW
2002
13 years 8 months ago
2002
ive. This characterization leads to model-based abstractions and representation design techniques as potential solutions. Many of the existing approaches to coping with data overlo...
ICCV
2011
IEEE
12 years 8 months ago
2011
IEEE
This paper focuses on the problem of word detection and recognition in natural images. The problem is significantly more challenging than reading text in scanned documents, and h...
ESA
2004
Springer
14 years 2 months ago
2004
Springer
Let G = (V, E) be an undirected multi-graph with a special vertex root ∈ V , and where each edge e ∈ E is endowed with a length l(e) ≥ 0 and a capacity c(e) > 0. For a pa...
CPAIOR
2010
Springer
14 years 1 months ago
2010
Springer
Constrained Optimum Path (COP) problems arise in many real-life applications and are ubiquitous in communication networks. They have been traditionally approached by dedicated algo...
ICALP
2005
Springer
14 years 2 months ago
2005
Springer
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...