3652 search results - page 324 / 731 » A study of query length |
167
Voted
EDBT
2012
ACM
13 years 6 months ago
2012
ACM
In this paper we consider the problem of answering queries using views, with or without ontological constraints, which is important for data integration, query optimization, and d...
128
click to vote
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
We study compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of NP decision problem...
131
Voted
SPAA
2004
ACM
15 years 9 months ago
2004
ACM
This paper considers the problem of packet-mode scheduling of input queuedswitches. Packets have variable lengths, and are divided into cells of unit length. Each packet arrives t...
153
click to vote
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
Using off-the-shelf commodity workstations and PCs to build a cluster for parallel computing has become a common practice. A choice of a cost-effective cluster computing platform ...
144
click to vote
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...