1736 search results - page 291 / 348 » The rank-width of Directed Graphs |
126
Voted
STACS
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
99
Voted
AINA
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract—Directed Acyclic Graphs (DAGs), rooted at popular/default destinations, have emerged as a preferred mechanism to provide IPv6 routing functionality in large scale low po...
125
click to vote
CSMR
2002
IEEE
15 years 5 months ago
2002
IEEE
Static analysis aims at recovering the structure of a software system, while dynamic analysis focuses on its run time behaviour. We propose a technique for combining the analysis ...
132
Voted
ICSM
2002
IEEE
15 years 5 months ago
2002
IEEE
When a software system enters the maintenance phase, the availability of accurate and consistent information about its organization can help alleviate the difficulties of program...
133
Voted
IEEEMSP
2002
IEEE
15 years 5 months ago
2002
IEEE
—This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and di...