Sciweavers

3341 search results - page 303 / 669
» On Bounded Queries and Approximation
Sort
View
COLT
2004
Springer
16 years 4 days ago
Learning a Hidden Graph Using O(log n) Queries Per Edge
We consider the problem of learning a general graph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden grap...
Dana Angluin, Jiang Chen
DEXA
2003
Springer
149views Database» more  DEXA 2003»
15 years 12 months ago
Capturing Uncertainty in Spatial Queries over Imprecise Data
Emerging applications using miniature electronic devices (e.g., tracking mobile objects using sensors) generate very large amounts of highly dynamic data that poses very high overh...
Xingbo Yu, Sharad Mehrotra
ER
2008
Springer
110views Database» more  ER 2008»
15 years 8 months ago
Conjunctive Query Containment under Access Limitations
Access limitations may occur when querying data sources over the web or heterogeneous data sources presented as relational tables: this happens, for instance, in Data Exchange and ...
Andrea Calì, Davide Martinenghi
ALT
2009
Springer
16 years 3 months ago
Learning Finite Automata Using Label Queries
We consider the problem of learning a finite automaton M of n states with input alphabet X and output alphabet Y when a teacher has helpfully or randomly labeled the states of M u...
Dana Angluin, Leonor Becerra-Bonache, Adrian Horia...
EDBT
2004
ACM
147views Database» more  EDBT 2004»
16 years 4 days ago
Clustering Multidimensional Extended Objects to Speed Up Execution of Spatial Queries
Abstract. We present a cost-based adaptive clustering method to improve average performance of spatial queries (intersection, containment, enclosure queries) over large collections...
Cristian-Augustin Saita, François Llirbat