Sciweavers

868 search results - page 56 / 174
» A general compression algorithm that supports fast searching
Sort
View
WWW
2005
ACM
14 years 9 months ago
Three-level caching for efficient query processing in large Web search engines
Large web search engines have to answer thousands of queries per second with interactive response times. Due to the sizes of the data sets involved, often in the range of multiple...
Xiaohui Long, Torsten Suel
CVPR
2008
IEEE
14 years 11 months ago
Boosting ordinal features for accurate and fast iris recognition
In this paper, we present a novel iris recognition method based on learned ordinal features.Firstly, taking full advantages of the properties of iris textures, a new iris represen...
Zhaofeng He, Zhenan Sun, Tieniu Tan, Xianchao Qiu,...
CIKM
2006
Springer
14 years 21 days ago
A fast and robust method for web page template detection and removal
The widespread use of templates on the Web is considered harmful for two main reasons. Not only do they compromise the relevance judgment of many web IR and web mining methods suc...
Karane Vieira, Altigran Soares da Silva, Nick Pint...
PODC
2009
ACM
14 years 9 months ago
Fast distributed random walks
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...
SP
2000
IEEE
117views Security Privacy» more  SP 2000»
14 years 1 months ago
Practical Techniques for Searches on Encrypted Data
It is desirable to store data on data storage servers such as mail servers and file servers in encrypted form to reduce security and privacy risks. But this usually implies that ...
Dawn Xiaodong Song, David Wagner, Adrian Perrig