Sciweavers

3508 search results - page 221 / 702
» Zero-Error Information Theory
Sort
View
194
Voted
WWW
2009
ACM
16 years 7 months ago
Query clustering using click-through graph
In this paper we describe a problem of discovering query clusters from a click-through graph of web search logs. The graph consists of a set of web search queries, a set of pages ...
Jeonghee Yi, Farzin Maghoul
CCS
2009
ACM
16 years 7 months ago
Quantifying maximal loss of anonymity in protocols
There is a natural intuitive match between anonymity and information theory. In particular, the maximal anonymity loss in anonymity protocols can be matched to the information the...
Han Chen, Pasquale Malacaria
KDD
2009
ACM
169views Data Mining» more  KDD 2009»
16 years 1 months ago
On burstiness-aware search for document sequences
As the number and size of large timestamped collections (e.g. sequences of digitized newspapers, periodicals, blogs) increase, the problem of efficiently indexing and searching su...
Theodoros Lappas, Benjamin Arai, Manolis Platakis,...
AIRWEB
2007
Springer
16 years 26 days ago
Transductive Link Spam Detection
Web spam can significantly deteriorate the quality of search engines. Early web spamming techniques mainly manipulate page content. Since linkage information is widely used in we...
Dengyong Zhou, Chris Burges, Tao Tao
166
Voted
GECCO
2007
Springer
187views Optimization» more  GECCO 2007»
16 years 25 days ago
Agent-environment interaction in a multi-agent system: a formal model
In this paper, we introduce a formal-language model for explicitly formalizing agent-environment interaction in a multiagent systems (MAS) framework: Conversational Grammar System...
Gemma Bel Enguix, Maria Dolores Jiménez-L&o...