Sciweavers

5130 search results - page 187 / 1026
» Constraint Query Languages
Sort
View
AMAI
2004
Springer
15 years 12 months ago
Learning via Finitely Many Queries
This work introduces a new query inference model that can access data and communicate with a teacher by asking finitely many boolean queries in a language L. In this model the pa...
Andrew C. Lee
SIGMOD
2011
ACM
249views Database» more  SIGMOD 2011»
14 years 9 months ago
ProApproX: a lightweight approximation query processor over probabilistic trees
We demonstrate a system for querying probabilistic XML documents with simple XPath queries. A user chooses between a variety of query answering techniques, both exact and approxim...
Pierre Senellart, Asma Souihli
ICLP
1995
Springer
15 years 10 months ago
Operational Semantics of Constraint Logic Programs with Coroutining
The semantics of constraint logic programming languages with coroutining facilities (\freeze," suspension, residuation, etc.) cannot be fully declarative; thus, an operationa...
Andreas Podelski, Gert Smolka
ECIR
2010
Springer
15 years 4 months ago
Query Aspect Based Term Weighting Regularization in Information Retrieval
Abstract. Traditional retrieval models assume that query terms are independent and rank documents primarily based on various term weighting strategies including TF-IDF and document...
Wei Zheng, Hui Fang
CONSTRAINTS
1998
112views more  CONSTRAINTS 1998»
15 years 6 months ago
Temporal Constraints: A Survey
Abstract. Temporal Constraint Satisfaction is an information technology useful for representing and answering queries about the times of events and the temporal relations between t...
Eddie Schwalb, Lluís Vila