2957 search results - page 211 / 592 » The Complexity of Polynomial-Time Approximation |
168
click to vote
TAMC
2007
Springer
16 years 21 days ago
2007
Springer
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
186
click to vote
SSD
2001
Springer
15 years 11 months ago
2001
Springer
Spatial joins are fundamental in spatial databases. Over the last decade, the primary focus of research has been on joins with the predicate “region intersection.” In modern da...
177
click to vote
ICDT
2010
ACM
15 years 10 months ago
2010
ACM
Relational data exchange deals with translating a relational database instance over some source schema into a relational database instance over some target schema, according to a ...
180
click to vote
RTSS
1992
IEEE
15 years 10 months ago
1992
IEEE
This paper addresses the problem of allocating (assigning and scheduling) periodic task modules to processing nodes in distributed real-time systems subject to task precedence and ...
180
click to vote
SBBD
2004
15 years 8 months ago
2004
Multi-valued dependencies (MVDs) are an important class of constraints that is fundamental for relational database design. Although modern applications increasingly require the su...