Sciweavers

1692 search results - page 54 / 339
» Applying Science Models for Search
Sort
View
PRICAI
2004
Springer
14 years 2 months ago
Solving Over-Constrained Temporal Reasoning Problems Using Local Search
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
Matthew Beaumont, John Thornton, Abdul Sattar, Mic...
SIGIR
2010
ACM
14 years 18 days ago
Inferring user intent in web search by exploiting social annotations
In this paper, we present a folksonomy-based approach for implicit user intent extraction during a Web search process. We present a number of result re-ranking techniques based on...
Jose M. Conde, David Vallet, Pablo Castells
STOC
2006
ACM
152views Algorithms» more  STOC 2006»
14 years 9 months ago
Private approximation of search problems
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb
IDEAS
2002
IEEE
135views Database» more  IDEAS 2002»
14 years 1 months ago
On Implicate Discovery and Query Optimization
Boolean expression simplification is a well-known problem in the history of Computer Science. The problem of determining prime implicates from an arbitrary Boolean expression has...
Kristofer Vorwerk, G. N. Paulley
COMGEO
2010
ACM
14 years 1 months ago
GIRPharma: a geographic information retrieval approach to locate pharmacies on duty
This paper describes an approximation based on geographic information retrieval with the purpose to give some solutions to the problem of searching pharmacies on duty in the Spani...
Francisco M. Rangel Pardo, Loli Rangel Pardo, Davi...