1404 search results - page 179 / 281 » Optimization problems in multiple-interval graphs |
127
click to vote
NIPS
2001
15 years 4 months ago
2001
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association...
119
click to vote
DATE
2009
IEEE
15 years 9 months ago
2009
IEEE
—In modern sub-micron design, achieving low-skew clock distributions is facing challenges for high-performance circuits. Symmetric global clock distribution and clock tree synthe...
106
click to vote
IPPS
2005
IEEE
15 years 8 months ago
2005
IEEE
This paper studies distributed scheduling of parallel I/O data transfers on systems that provide data replication. In our previous work, we proposed a centralized algorithm for so...
112
click to vote
WEBDB
2009
Springer
15 years 9 months ago
2009
Springer
The question whether a given set of views, defined by queries, can be used to answer another query, arises in several contexts such as query optimization, data integration and se...
135
click to vote
WG
2007
Springer
15 years 9 months ago
2007
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...