Sciweavers

6740 search results - page 174 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
COMPGEOM
2001
ACM
14 years 2 months ago
Efficient and small representation of line arrangements with applications
This paper addresses the problem of lossy compression of arrangements. Given an arrangement of n lines in the plane, we show how to construct another arrangement consisting of man...
David P. Dobkin, Ayellet Tal
AMC
2007
164views more  AMC 2007»
13 years 10 months ago
The method of lines for the numerical solution of a mathematical model for capillary formation: The role of endothelial cells in
In this paper we present the method of lines to obtain the numerical solution of a mathematical model for capillary formation in tumor angiogenesis. This method is an approach to ...
Serdal Pamuk, Arzu Erdem
ICDAR
2005
IEEE
14 years 4 months ago
Text Extraction from Gray Scale Historical Document Images Using Adaptive Local Connectivity Map
This paper presents an algorithm using adaptive local connectivity map for retrieving text lines from the complex handwritten documents such as handwritten historical manuscripts....
Zhixin Shi, Srirangaraj Setlur, Venu Govindaraju
MFCS
2007
Springer
14 years 4 months ago
On the Complexity of Computing Treelength
We resolve the computational complexity of determining the treelength of a graph, thereby solving an open problem of Dourisboure and Gavoille, who introduced this parameter, and a...
Daniel Lokshtanov
ECBS
2009
IEEE
130views Hardware» more  ECBS 2009»
14 years 5 months ago
Validating and Dynamically Adapting and Composing Features in Concurrent Product-Lines Applications
With the pressing in-time-market towards customized services, software product lines (SPL) are increasingly characterizing most of software landscape. SPL are mainly structured th...
Nasreddine Aoumeur, Kamel Barkaoui, Gunter Saake