332 search results - page 65 / 67 » Parameterized Graph Separation Problems |
APPROX
2011
Springer
12 years 7 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
KDD
2008
ACM
14 years 7 months ago
2008
ACM
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
CPAIOR
2006
Springer
13 years 11 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
SIGMOD
1997
ACM
13 years 11 months ago
1997
ACM
The Strudel system applies concepts from database management systems to the process of building Web sites. Strudel’s key idea is separating the management of the site’s data, t...
VLDB
2008
ACM
14 years 7 months ago
2008
ACM
With the development of inexpensive storage devices, space usage is no longer a bottleneck for computer users. However, the increasingly large amount of personal information poses ...