Sciweavers

35 search results - page 6 / 7
» Minimization of tree pattern queries with constraints
Sort
View
DKE
2008
96views more  DKE 2008»
13 years 5 months ago
Fragment-based approximate retrieval in highly heterogeneous XML collections
Due to the heterogeneous nature of XML data for internet applications exact matching of queries is often inadequate. The need arises to quickly identify subtrees of XML documents ...
Ismael Sanz, Marco Mesiti, Giovanna Guerrini, Rafa...
VLDB
2007
ACM
181views Database» more  VLDB 2007»
14 years 5 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...
PKDD
2009
Springer
184views Data Mining» more  PKDD 2009»
13 years 10 months ago
Boosting Active Learning to Optimality: A Tractable Monte-Carlo, Billiard-Based Algorithm
Abstract. This paper focuses on Active Learning with a limited number of queries; in application domains such as Numerical Engineering, the size of the training set might be limite...
Philippe Rolet, Michèle Sebag, Olivier Teyt...
KDD
2012
ACM
178views Data Mining» more  KDD 2012»
11 years 8 months ago
Differentially private transit data publication: a case study on the montreal transportation system
With the wide deployment of smart card automated fare collection (SCAFC) systems, public transit agencies have been benefiting from huge volume of transit data, a kind of sequent...
Rui Chen, Benjamin C. M. Fung, Bipin C. Desai, N&e...
WSNA
2003
ACM
13 years 11 months ago
Information-directed routing in ad hoc sensor networks
—In a sensor network, data routing is tightly coupled to the needs of a sensing task, and hence the application semantics. This paper introduces the novel idea of information-dir...
Juan Liu, Feng Zhao, Dragan Petrovic