Sciweavers

796 search results - page 137 / 160
» Approximating the centroid is hard
Sort
View
GECCO
2009
Springer
138views Optimization» more  GECCO 2009»
14 years 2 months ago
IMAD: in-execution malware analysis and detection
The sophistication of computer malware is becoming a serious threat to the information technology infrastructure, which is the backbone of modern e-commerce systems. We, therefore...
Syed Bilal Mehdi, Ajay Kumar Tanwani, Muddassar Fa...
IMC
2009
ACM
14 years 2 months ago
Scalable proximity estimation and link prediction in online social networks
Proximity measures quantify the closeness or similarity between nodes in a social network and form the basis of a range of applications in social sciences, business, information t...
Han Hee Song, Tae Won Cho, Vacha Dave, Yin Zhang, ...
SIGECOM
2009
ACM
137views ECommerce» more  SIGECOM 2009»
14 years 2 months ago
An exact almost optimal algorithm for target set selection in social networks
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, I...
SIGIR
2009
ACM
14 years 2 months ago
Good abandonment in mobile and PC internet search
Query abandonment by search engine users is generally considered to be a negative signal. In this paper, we explore the concept of good abandonment. We define a good abandonment ...
Jane Li, Scott B. Huffman, Akihito Tokuda
FOCS
2008
IEEE
14 years 2 months ago
What Can We Learn Privately?
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi ...