1039 search results - page 31 / 208 » Query reformulation with constraints |
130
click to vote
JFP
2007
15 years 4 months ago
2007
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 ...
127
click to vote
SIGIR
2009
ACM
15 years 11 months ago
2009
ACM
In this paper we examine user queries with respect to diversity: providing a mix of results across different interpretations. Using two query log analysis techniques (click entrop...
129
click to vote
VTC
2007
IEEE
15 years 10 months ago
2007
IEEE
—In this paper, we propose a low-complexity scheme for minimizing energy consumption in a clustered multirate CDMA sensor network with multiple receive antennas by jointly contro...
174
click to vote
LCC
1994
15 years 8 months ago
1994
We give an AC0 upper bound on the complexity of rst-oder queries over (in nite) databases de ned by restricted linear constraints. This result enables us to deduce the non-expressi...
140
click to vote
EDBTW
2004
Springer
15 years 9 months ago
2004
Springer
The problem of answering queries posed to a peer who is a member of a peer-to-peerdataexchangesystemisstudied.Theanswershavetobeconsistentwrt to both the local semantic constraints...