9842 search results - page 1695 / 1969 » The Complexity of the Matching-Cut Problem |
138
click to vote
WIDM
2003
ACM
15 years 9 months ago
2003
ACM
Query rewriting using views is an essential issue in data integration. A number of algorithms, e.g., the bucket algorithm, the inverse rules algorithm, the SVB algorithm and the M...
173
click to vote
CAISE
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. Even though SQL has become widely accepted as a language for implementing relational database schemas and querying data, there are cases where s experience the need for n...
124
click to vote
ICALP
2003
Springer
15 years 9 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
139
click to vote
GLVLSI
2010
IEEE
15 years 9 months ago
2010
IEEE
Meeting the temperature constraints and reducing the hot-spots are critical for achieving reliable and efficient operation of complex multi-core systems. The goal of thermal mana...
177
click to vote
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...