Sciweavers

Share
CCR
2011
8 years 9 months ago
Session reports for SIGCOMM 2010
This document collects together reports of the sessions from the 2010 ACM SIGCOMM Conference, the annual conference of the ACM Special Interest Group on Data Communication (SIGCOM...
Shailesh Agrawal, Kavitha Athota, Pramod Bhatotia,...
HT
2010
ACM
8 years 12 months ago
On the robustness of google scholar against spam
In this poster we present the current results of several experiments in which we analyzed whether spamming Google Scholar is possible. Our results show, it is possible: We ,,impro...
Jöran Beel, Bela Gipp
CIKM
2009
Springer
9 years 12 days ago
TSA'09 workshop summary: topic-sentiment analysis
This workshop seeks to bring together researchers in both computer science and social sciences who are interested in developing and using topic-sentiment analysis methods to measu...
Bei Yu, Maojin Jiang
CIKM
2010
Springer
9 years 18 days ago
Combining link and content for collective active learning
In this paper, we study a novel problem Collective Active Learning, in which we aim to select a batch set of "informative" instances from a networking data set to query ...
Lixin Shi, Yuhang Zhao, Jie Tang
AND
2010
9 years 19 days ago
Discovering users' topics of interest on twitter: a first look
Twitter, a micro-blogging service, provides users with a framework for writing brief, often-noisy postings about their lives. These posts are called "Tweets." In this pa...
Matthew Michelson, Sofus A. Macskassy
SIGOPS
2010
272views more  SIGOPS 2010»
9 years 29 days ago
The Akamai network: a platform for high-performance internet applications
Comprising more than 61,000 servers located across nearly 1,000 networks in 70 countries worldwide, the Akamai platform delivers hundreds of billions of Internet interactions dail...
Erik Nygren, Ramesh K. Sitaraman, Jennifer Sun
SIGIR
2008
ACM
9 years 2 months ago
Personal vs non-personal blogs: initial classification experiments
We address the task of separating personal from non-personal blogs, and report on a set of baseline experiments where we compare the performance on a small set of features across ...
Erik Elgersma, Maarten de Rijke
DIALM
2005
ACM
104views Algorithms» more  DIALM 2005»
9 years 4 months ago
Information dissemination in highly dynamic graphs
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
Regina O'Dell, Roger Wattenhofer
COMPGEOM
2005
ACM
9 years 4 months ago
Stability of persistence diagrams
The persistence diagram of a real-valued function on a topological space is a multiset of points in the extended plane. We prove that under mild assumptions on the function, the p...
David Cohen-Steiner, Herbert Edelsbrunner, John Ha...
GECCO
2006
Springer
135views Optimization» more  GECCO 2006»
9 years 6 months ago
Characterizing the dynamics of symmetry breaking in genetic programming
This paper introduces a metric that measures symmetry in tree graphs, which allows for a statistical characterization of GP solutions by their architectural "shapes." A ...
Jason M. Daida
books