7129 search results - page 386 / 1426 » Approximation Algorithms for Treewidth |
135
click to vote
PVLDB
2008
15 years 4 months ago
2008
In probabilistic databases, lineage is fundamental to both query processing and understanding the data. Current systems s.a. Trio or Mystiq use a complete approach in which the li...
160
click to vote
ESWS
2009
Springer
15 years 11 months ago
2009
Springer
We consider the problem of a user querying semistructured data such as RDF without knowing its structure. In these circumstances, it is helpful if the querying system can perform a...
162
click to vote
ESA
2005
Springer
15 years 10 months ago
2005
Springer
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
128
click to vote
CIKM
2003
Springer
15 years 10 months ago
2003
Springer
High dimensional data sets are encountered in many modern database applications. The usual approach is to construct a summary of the data set through a lossy compression technique...
151
Voted
HYBRID
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. In this paper we present an approach to approximate reachability computation for nonlinear continuous systems. Rather than studying a complex nonlinear system ˙x = g(x),...