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...
David D. Woods, Emily S. Patterson, Emilie M. Roth
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...
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...
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...
Pham Quang Dung, Yves Deville, Pascal Van Hentenry...
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...