Sciweavers

265 search results - page 35 / 53
» How Many Query Superpositions Are Needed to Learn
Sort
View
PEPM
2010
ACM
14 years 4 months ago
Optimizing relational algebra operations using generic equivalence discriminators and lazy products
We show how to efficiently evaluate generic map-filter-product queries, generalizations of select-project-join (SPJ) queries in relational algebra, based on a combination of two...
Fritz Henglein
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 7 months ago
Settling the Polynomial Learnability of Mixtures of Gaussians
Given data drawn from a mixture of multivariate Gaussians, a basic problem is to accurately estimate the mixture parameters. We give an algorithm for this problem that has running ...
Ankur Moitra, Gregory Valiant
ICDE
2010
IEEE
217views Database» more  ICDE 2010»
14 years 2 months ago
Toward industrial-strength keyword search systems over relational data
– Keyword search (KWS) over relational data, where the answers are multiple tuples connected via joins, has received significant attention in the past decade. Numerous solutions ...
Akanksha Baid, Ian Rae, AnHai Doan, Jeffrey F. Nau...
SIGMOD
2012
ACM
210views Database» more  SIGMOD 2012»
11 years 10 months ago
Interactive regret minimization
We study the notion of regret ratio proposed in [19] to deal with multi-criteria decision making in database systems. The regret minimization query proposed in [19] was shown to h...
Danupon Nanongkai, Ashwin Lall, Atish Das Sarma, K...
SIGMOD
2007
ACM
125views Database» more  SIGMOD 2007»
14 years 7 months ago
Identifying meaningful return information for XML keyword search
Keyword search enables web users to easily access XML data without the need to learn a structured query language and to study possibly complex data schemas. Existing work has addr...
Ziyang Liu, Yi Chen