Abstract: Social Influence Maximization Problems (SIMPs) deal with selecting k seeds in a given Online Social Network (OSN) to maximize the number of eventually-influenced users. This is done by using ...

我记得这篇论文问世的时候, 有句话让我印象太深刻了: 凡是过往, 皆为调参? 本文受启发于 Bag-of-Features 模型, 这类模型的最典型代表应该要数 Bag-of-Words 了. 拿 BoW 作类比的话, BoW 用句子中单词出现的次数来表示该句子, 不考虑单词间的关系, 比如"我/爱/北京 ...

Archimedes determined the upper and lower range of pi by finding the perimeters of inscribed and circumscribed polygons. By doubling the number of sides of the hexagon to a 12-sided polygon, then ...

Abstract: We introduce a simple evolution scheme for multiobjective optimization problems, called the Pareto Archived Evolution Strategy (PAES). We argue that PAES may represent the simplest possible ...

As we will see in the subsequent chapters, it is usually most efficient to approximate the Newton step in some way. One way to do this is to approximate F ?( x n) in a way that not only avoids ...