Sciweavers

610 search results - page 101 / 122
» Efficient Query Evaluation on Probabilistic Databases
Sort
View
KDD
2009
ACM
227views Data Mining» more  KDD 2009»
15 years 10 months ago
Efficiently learning the accuracy of labeling sources for selective sampling
Many scalable data mining tasks rely on active learning to provide the most useful accurately labeled instances. However, what if there are multiple labeling sources (`oracles...
Pinar Donmez, Jaime G. Carbonell, Jeff Schneider
CIKM
2006
Springer
15 years 1 months ago
Heuristic containment check of partial tree-pattern queries in the presence of index graphs
The wide adoption of XML has increased the interest of the database community on tree-structured data management techniques. Querying capabilities are provided through tree-patter...
Dimitri Theodoratos, Stefanos Souldatos, Theodore ...
SIGMOD
2005
ACM
126views Database» more  SIGMOD 2005»
15 years 10 months ago
Cost-Sensitive Reordering of Navigational Primitives
We present a method to evaluate path queries based on the novel concept of partial path instances. Our method (1) maximizes performance by means of sequential scans or asynchronou...
Carl-Christian Kanne, Matthias Brantner, Guido Moe...
VLDB
2004
ACM
152views Database» more  VLDB 2004»
15 years 10 months ago
Balancing energy efficiency and quality of aggregate data in sensor networks
In-network aggregation has been proposed as one method for reducing energy consumption in sensor networks. In this paper, we explore two ideas related to further reducing energy co...
Mohamed A. Sharaf, Jonathan Beaver, Alexandros Lab...
GIS
2007
ACM
15 years 10 months ago
Quality-driven geospatial data integration
Accurate and efficient integration of geospatial data is an important problem with applications in areas such as emergency response and urban planning. Some of the key challenges ...
Craig A. Knoblock, José Luis Ambite, Snehal...