489 search results - page 36 / 98 » Approximation Algorithms for the Minimum-Length Corridor and... |
160
click to vote
PODS
2003
ACM
16 years 4 months ago
2003
ACM
We consider the view selection problem for XML content based routing: given a network, in which a stream of XML documents is routed and the routing decisions are taken based on re...
128
click to vote
CP
2008
Springer
15 years 5 months ago
2008
Springer
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
111
click to vote
TACAS
2005
Springer
15 years 9 months ago
2005
Springer
This paper addresses the problem of generating symbolic test cases for testing the conformance of a black-box implementation with respect to a specification, in the context of rea...
212
Voted
ICDE
2006
IEEE
16 years 5 months ago
2006
IEEE
We consider the problem of continuously maintaining order sketches over data streams with a relative rank error guarantee . Novel space-efficient and one-scan randomised technique...
150
click to vote
SODA
2008
ACM
15 years 5 months ago
2008
ACM
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...