Sciweavers

3341 search results - page 316 / 669
» On Bounded Queries and Approximation
Sort
View
FOCS
2008
IEEE
16 years 1 months ago
Two Query PCP with Sub-Constant Error
We show that the NP-Complete language 3SAT has a PCP verifier that makes two queries to a proof of almost-linear size and achieves sub-constant probability of error o(1). The ver...
Dana Moshkovitz, Ran Raz
AMW
2009
15 years 7 months ago
Consistent Query Answering in Data Warehouses
Abstract. A Data Warehouse (DW) is a data repository that organizes and physically integrates data from multiple sources under special kinds of schemas. A DW is composed by a set o...
Leopoldo E. Bertossi, Loreto Bravo, Mónica ...
EDBT
2008
ACM
99views Database» more  EDBT 2008»
16 years 6 months ago
Querying time-series streams
Index trees created using distance based indexing are difficult to maintain online since the distance function involved is often costly to compute. This problem is intensified whe...
Vivekanand Gopalkrishnan
UIST
2009
ACM
16 years 1 months ago
Relaxed selection techniques for querying time-series graphs
Time-series graphs are often used to visualize phenomena that change over time. Common tasks include comparing values at different points in time and searching for specified patte...
Christian Holz, Steven Feiner
207
Voted
FQAS
2009
Springer
196views Database» more  FQAS 2009»
15 years 11 months ago
Flexible SPARQL Querying of Web Data Tables Driven by an Ontology
This paper concerns the design of a workflow which permits to feed and query a data warehouse opened on the Web, driven by a domain ontology. This data warehouse has been built to...
Patrice Buche, Juliette Dibie-Barthélemy, H...