Sciweavers

705 search results - page 85 / 141
» Approximating Extended Answer Sets
Sort
View
FSTTCS
2008
Springer
14 years 11 months ago
Pruning 2-Connected Graphs
Given an edge-weighted undirected graph G with a specified set of terminals, let the density of any subgraph be the ratio of its weight/cost to the number of terminals it contain...
Chandra Chekuri, Nitish Korula
MST
2010
93views more  MST 2010»
14 years 8 months ago
Atomic Congestion Games: Fast, Myopic and Concurrent
We study here the effect of concurrent greedy moves of players in atomic congestion games where n selfish agents (players) wish to select a resource each (out of m resources) so ...
Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spira...
VLDB
2007
ACM
181views Database» more  VLDB 2007»
15 years 10 months ago
STAR: Self-Tuning Aggregation for Scalable Monitoring
We present STAR, a self-tuning algorithm that adaptively sets numeric precision constraints to accurately and efficiently answer continuous aggregate queries over distributed data...
Navendu Jain, Michael Dahlin, Yin Zhang, Dmitry Ki...
ECML
2007
Springer
15 years 4 months ago
Learning Balls of Strings with Correction Queries
When facing the question of learning languages in realistic settings, one has to tackle several problems that do not admit simple solutions. On the one hand, languages are usually...
Leonor Becerra-Bonache, Colin de la Higuera, Jean-...
FQAS
2009
Springer
196views Database» more  FQAS 2009»
15 years 2 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...