1149 search results - page 168 / 230 » Minimally non-Pfaffian graphs |
IWPC
2003
IEEE
15 years 5 months ago
2003
IEEE
Increasingly focus in the software comprehension community is shifting from representing the results of analysis in the graph and database domain to reflecting insights directly i...
WCRE
2003
IEEE
15 years 5 months ago
2003
IEEE
As software evolves, maintenance practices require a process of accommodating changing requirements while minimizing the cost of implementing those changes. Over time, incompatibi...
89
Voted
SPAA
2003
ACM
15 years 5 months ago
2003
ACM
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
117
click to vote
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...
124
click to vote
IEEEMSP
2002
IEEE
15 years 4 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...