Sciweavers

792 search results - page 39 / 159
» Computing Iceberg Queries Efficiently
Sort
View
PODS
2008
ACM
250views Database» more  PODS 2008»
15 years 10 months ago
Approximating predicates and expressive queries on probabilistic databases
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
Christoph Koch
JMLR
2010
115views more  JMLR 2010»
14 years 4 months ago
Fast and Scalable Local Kernel Machines
A computationally efficient approach to local learning with kernel methods is presented. The Fast Local Kernel Support Vector Machine (FaLK-SVM) trains a set of local SVMs on redu...
Nicola Segata, Enrico Blanzieri
MOBIDE
2005
ACM
15 years 3 months ago
Tolerance of localization imprecision in efficiently managing mobile sensor databases
Query processing on mobile sensor networks requires efficient indexing and partitioning of the data space to support efficient routing as the network scales up. Building an index ...
Lin Xiao, Aris M. Ouksel
ICDM
2005
IEEE
217views Data Mining» more  ICDM 2005»
15 years 3 months ago
Improving Automatic Query Classification via Semi-Supervised Learning
Accurate topical classification of user queries allows for increased effectiveness and efficiency in general-purpose web search systems. Such classification becomes critical if th...
Steven M. Beitzel, Eric C. Jensen, Ophir Frieder, ...
SIGMOD
2010
ACM
171views Database» more  SIGMOD 2010»
15 years 2 months ago
Variance aware optimization of parameterized queries
Parameterized queries are commonly used in database applications. In a parameterized query, the same SQL statement is potentially executed multiple times with different parameter ...
Surajit Chaudhuri, Hongrae Lee, Vivek R. Narasayya