3368 search results - page 137 / 674 » The Complexity of Query Reliability |
120
click to vote
EKAW
2006
Springer
15 years 6 months ago
2006
Springer
Semantic search promises to produce precise answers to user queries by taking advantage of the availability of explicit semantics of information in the context of the semantic web....
127
click to vote
ALGORITHMICA
2010
15 years 2 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
130
click to vote
BIBM
2010
IEEE
14 years 11 months ago
2010
IEEE
The emergence of data rich domains has led to an exponential growth in the size and number of data repositories, offering exciting opportunities to learn from the data using machin...
150
click to vote
SIGMOD
2003
ACM
16 years 2 months ago
2003
ACM
The learning-enhanced relevance feedback has been one of the most active research areas in content-based image retrieval in recent years. However, few methods using the relevance ...
138
click to vote
AAAI
2007
15 years 4 months ago
2007
Efficient query answering over ontologies is one of the most useful and important services to support Semantic Web applications. Approximation has been identified as a potential...