Sciweavers

1004 search results - page 31 / 201
» Safe Constraint Queries
Sort
View
FSTTCS
2007
Springer
14 years 2 months ago
Closures and Modules Within Linear Logic Concurrent Constraint Programming
There are two somewhat contradictory ways of looking at modules in a given programming language. On the one hand, module systems are largely independent of the particulars of progr...
Rémy Haemmerlé, François Fage...
WWW
2009
ACM
14 years 9 months ago
Releasing search queries and clicks privately
The question of how to publish an anonymized search log was brought to the forefront by a well-intentioned, but privacy-unaware AOL search log release. Since then a series of ad-h...
Aleksandra Korolova, Krishnaram Kenthapadi, Nina M...
ICPR
2008
IEEE
14 years 10 months ago
Active query selection for semi-supervised clustering
Semi-supervised clustering allows a user to specify available prior knowledge about the data to improve the clustering performance. A common way to express this information is in ...
Anil K. Jain, Pavan Kumar Mallapragada, Rong Jin
JFP
2007
104views more  JFP 2007»
13 years 8 months ago
Understanding functional dependencies via constraint handling rules
Functional dependencies are a popular and useful extension to Haskell style type classes. We give a reformulation of functional dependencies in terms of Constraint Handling Rules ...
Martin Sulzmann, Gregory J. Duck, Simon L. Peyton ...
ICEIS
2006
IEEE
14 years 2 months ago
Filtering Unsatisfiable XPATH Queries
The satisfiability test checks, whether or not the evaluation of a query returns the empty set for any input document, and can be used in query optimization for avoiding the submis...
Jinghua Groppe, Sven Groppe