Sciweavers

2111 search results - page 305 / 423
» Understanding the Yarowsky Algorithm
Sort
View
CEAS
2008
Springer
15 years 8 months ago
A Campaign-based Characterization of Spamming Strategies
This paper presents a methodology for the characterization of spamming strategies based on the identification of spam campaigns. To deeply understand how spammers abuse network re...
Pedro Calais, Douglas Pires, Dorgival Olavo Guedes...
ITP
2010
178views Mathematics» more  ITP 2010»
15 years 8 months ago
Interactive Termination Proofs Using Termination Cores
Recent advances in termination analysis have yielded new methods and tools that are highly automatic. However, when they fail, even experts have difficulty understanding why and de...
Panagiotis Manolios, Daron Vroon
CIKM
2008
Springer
15 years 8 months ago
Ranked feature fusion models for ad hoc retrieval
We introduce the Ranked Feature Fusion framework for information retrieval system design. Typical information retrieval formalisms such as the vector space model, the bestmatch mo...
Jeremy Pickens, Gene Golovchinsky
DEXA
2005
Springer
101views Database» more  DEXA 2005»
15 years 8 months ago
On the Midpoint of a Set of XML Documents
The WWW contains a huge amount of documents. Some of them share the subject, but are generated by different people or even organizations. To guarantee the interchange of such docu...
Alberto Abelló, Xavier de Palol, Mohand-Sai...
IDA
2010
Springer
15 years 8 months ago
A Framework for Path-Oriented Network Simplification
Abstract. We propose a generic framework and methods for simplification of large networks. The methods can be used to improve the understandability of a given network, to complemen...
Hannu Toivonen, Sébastien Mahler, Fang Zhou