Sciweavers

4903 search results - page 61 / 981
» The Set Covering Machine
Sort
View
138
Voted
ISAAC
2010
Springer
226views Algorithms» more  ISAAC 2010»
15 years 15 days ago
On Tractable Cases of Target Set Selection
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
André Nichterlein, Rolf Niedermeier, Johann...
110
Voted
ISBI
2002
IEEE
16 years 3 months ago
Covariance-driven retinal image registration initialized from small sets of landmark correspondences
An automatic retinal image registration algorithm would be an important tool for detecting visible changes in the retina caused by the progress of a disease or by the impact of a ...
Chia-Ling Tsai, Charles V. Stewart, Badrinath Roys...
143
Voted
CEAS
2011
Springer
14 years 2 months ago
Blocking spam by separating end-user machines from legitimate mail server machines
Spamming botnets present a critical challenge in the control of spam messages due to the sheer volume and wide spread of the botnet members. In this paper we advocate the approach...
Fernando Sanchez, Zhenhai Duan, Yingfei Dong
120
Voted
SIGIR
2010
ACM
15 years 6 months ago
Metrics for assessing sets of subtopics
To evaluate the diversity of search results, test collections have been developed that identify multiple intents for each query. Intents are the different meanings or facets that...
Filip Radlinski, Martin Szummer, Nick Craswell
ICGI
2010
Springer
15 years 3 months ago
Generalizing over Several Learning Settings
We recapitulate regular one-shot learning from membership and equivalence queries, positive and negative finite data. We present a meta-algorithm that generalizes over as many sett...
Anna Kasprzik