1456 search results - page 81 / 292 » Two Techniques to Improve Finite Model Search |
ALGORITHMICA
2010
13 years 8 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...
SIGIR
2009
ACM
14 years 2 months ago
2009
ACM
Incorporating features extracted from clickthrough data (called clickthrough features) has been demonstrated to significantly improve the performance of ranking models for Web sea...
ERCIMDL
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Recent work on analyzing query logs shows that a significant fraction of queries are temporal, i.e., relevancy is dependent on time, and temporal queries play an importan...
IPM
2008
13 years 8 months ago
2008
This paper reports on the underlying IR problems encountered when dealing with the complex morphology and compound constructions found in the Hungarian language. It describes evalu...
AROBOTS
2007
13 years 8 months ago
2007
— A team of small, low-cost robots instead of a single large, complex robot is useful in operations such as search and rescue, urban exploration etc. However, the performance of ...