1041 search results - page 129 / 209 » Randomizing Reductions of Search Problems |
CIKM
2006
Springer
13 years 11 months ago
2006
Springer
It is important yet hard to identify navigational queries in Web search due to a lack of sufficient information in Web queries, which are typically very short. In this paper we st...
ICMCS
2007
IEEE
14 years 2 months ago
2007
IEEE
A major problem in metropolitan areas is searching for parking spaces. In this paper, we propose a novel method for parking space detection. Given input video captured by a camera...
FGCS
2007
13 years 7 months ago
2007
Solving the structure prediction problem for complex proteins is difficult and computationally expensive. In this paper, we propose a bicriterion parallel hybrid genetic algorith...
SIGIR
2009
ACM
14 years 2 months ago
2009
ACM
It is now widely recognized that user interactions with search results can provide substantial relevance information on the documents displayed in the search results. In this pape...
STOC
2007
ACM
14 years 8 months ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...