Sciweavers

491 search results - page 31 / 99
» Optimizing complex queries with multiple relation instances
Sort
View
ICML
2009
IEEE
14 years 8 months ago
A convex formulation for learning shared structures from multiple tasks
Multi-task learning (MTL) aims to improve generalization performance by learning multiple related tasks simultaneously. In this paper, we consider the problem of learning shared s...
Jianhui Chen, Lei Tang, Jun Liu, Jieping Ye
ICDE
2006
IEEE
178views Database» more  ICDE 2006»
14 years 9 months ago
Declarative Querying for Biological Sequences
The ongoing revolution in life sciences research is producing vast amounts of genetic and proteomic sequence data. Scientists want to pose increasingly complex queries on this dat...
Sandeep Tata, Jignesh M. Patel, James S. Friedman,...
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
14 years 8 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
14 years 7 months ago
ViewJoin: Efficient View-based Evaluation of Tree Pattern Queries
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
Ding Chen, Chee-Yong Chan
SIGMOD
2012
ACM
222views Database» more  SIGMOD 2012»
11 years 10 months ago
Tiresias: a demonstration of how-to queries
In this demo, we will present Tiresias, the first how-to query engine. How-to queries represent fundamental data analysis questions of the form: “How should the input change in...
Alexandra Meliou, Yisong Song, Dan Suciu