1931 search results - page 50 / 387 » Why we blog |
162
click to vote
WSDM
2009
ACM
16 years 12 days ago
2009
ACM
Web search queries capture the information need of search engine users. Search engines store these queries in their logs and analyze them to guide their search results. In this wo...
160
Voted
SPIRE
2010
Springer
15 years 4 months ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
163
click to vote
ENTCS
2011
15 years 18 days ago
2011
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, ‘Computational Complexity in Non-Turing Models of Computationâ...
137
click to vote
CHI
2006
ACM
16 years 6 months ago
2006
ACM
To build systems shielding users from fraudulent (or phishing) websites, designers need to know which attack strategies work and why. This paper provides the first empirical evide...
235
Voted
SIGMOD
2006
ACM
16 years 5 months ago
2006
ACM
Adaptive query processing has been the subject of a great deal of recent work, particularly in emerging data management environments such as data integration and data streams. We ...