Sciweavers

5130 search results - page 157 / 1026
» Constraint Query Languages
Sort
View
KDD
2004
ACM
139views Data Mining» more  KDD 2004»
16 years 3 months ago
Machine learning for online query relaxation
In this paper we provide a fast, data-driven solution to the failing query problem: given a query that returns an empty answer, how can one relax the query's constraints so t...
Ion Muslea
105
Voted
SIGMOD
2010
ACM
200views Database» more  SIGMOD 2010»
15 years 3 months ago
QRelX: generating meaningful queries that provide cardinality assurance
In many business and consumer applications, queries have cardinality constraints. However, current database systems provide minimal support for cardinality assurance. Consequently...
Manasi Vartak, Venkatesh Raghavan, Elke A. Rundens...
ICFP
2008
ACM
16 years 2 months ago
From ML to MLF: graphic type constraints with efficient type inference
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
Boris Yakobowski, Didier Rémy
CSR
2007
Springer
15 years 9 months ago
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
ISORC
2009
IEEE
15 years 9 months ago
On the Semantics of UML/MARTE Clock Constraints
The UML goal of being a general-purpose modeling language discards the possibility to adopt too precise and strict a semantics. Users are to refine or define the semantics in th...
Frédéric Mallet, Charles André...