868 search results - page 81 / 174 » A general compression algorithm that supports fast searching |
WSDM
2010
ACM
14 years 6 months ago
2010
ACM
This article describes an application of the partially observable Markov (POM) model to the analysis of a large scale commercial web search log. Mathematically, POM is a variant o...
WWW
2008
ACM
14 years 9 months ago
2008
ACM
Determining candidates' views on important issues is critical in deciding whom to support and vote for; but finding their statements and votes on an issue can be laborious. I...
RAID
1999
Springer
14 years 1 months ago
1999
Springer
We approached this line of inquiry by questioning the conventional wisdom that audit logs are too large to be analyzed and must be reduced and filtered before the data can be anal...
JAL
2002
13 years 8 months ago
2002
We take a multivariate view of digital search trees by studying the number of nodes of different types that may coexist in a bucket digital search tree as it grows under an arbitr...
WWW
2008
ACM
14 years 9 months ago
2008
ACM
For extracting the characteristics a specific geographic entity, and notably a place, we propose to use dynamic Extreme Tagging Systems in combination with the classic approach of...