Sciweavers

26354 search results - page 5026 / 5271
» How we refactor, and how we know it
Sort
View
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
14 years 9 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
CCS
2011
ACM
14 years 6 months ago
Cloak and dagger: dynamics of web search cloaking
Cloaking is a common “bait-and-switch” technique used to hide the true nature of a Web site by delivering blatantly different semantic content to different user segments. It i...
David Y. Wang, Stefan Savage, Geoffrey M. Voelker
CCS
2011
ACM
14 years 6 months ago
PaperSpeckle: microscopic fingerprinting of paper
Paper forgery is among the leading causes of corruption in many developing regions [2]. In this paper, we introduce PaperSpeckle, a robust system that leverages the natural random...
Ashlesh Sharma, Lakshminarayanan Subramanian, Eric...
CIKM
2011
Springer
14 years 6 months ago
Exploiting longer cycles for link prediction in signed networks
We consider the problem of link prediction in signed networks. Such networks arise on the web in a variety of ways when users can implicitly or explicitly tag their relationship w...
Kai-Yang Chiang, Nagarajan Natarajan, Ambuj Tewari...
CIKM
2011
Springer
14 years 6 months ago
Personalizing web search results by reading level
Traditionally, search engines have ignored the reading difficulty of documents and the reading proficiency of users in computing a document ranking. This is one reason why Web se...
Kevyn Collins-Thompson, Paul N. Bennett, Ryen W. W...
« Prev « First page 5026 / 5271 Last » Next »