Sciweavers

10304 search results - page 1960 / 2061
» Computer science with the sciences: an emphasis in computati...
Sort
View
WWW
2007
ACM
16 years 2 months ago
Information flow modeling based on diffusion rate for prediction and ranking
Information flows in a network where individuals influence each other. The diffusion rate captures how efficiently the information can diffuse among the users in the network. We p...
Xiaodan Song, Yun Chi, Koji Hino, Belle L. Tseng
102
Voted
KDD
2009
ACM
174views Data Mining» more  KDD 2009»
16 years 2 months ago
Audience selection for on-line brand advertising: privacy-friendly social network targeting
This paper describes and evaluates privacy-friendly methods for extracting quasi-social networks from browser behavior on user-generated content sites, for the purpose of finding ...
Foster J. Provost, Brian Dalessandro, Rod Hook, Xi...
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
16 years 1 months ago
A fast algorithm for finding frequent episodes in event streams
Frequent episode discovery is a popular framework for mining data available as a long sequence of events. An episode is essentially a short ordered sequence of event types and the...
Srivatsan Laxman, P. S. Sastry, K. P. Unnikrishnan
138
Voted
ICALP
2009
Springer
16 years 1 months ago
Tight Bounds for the Cover Time of Multiple Random Walks
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...
Robert Elsässer, Thomas Sauerwald
ICALP
2009
Springer
16 years 1 months ago
Dynamic Succinct Ordered Trees
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...
Arash Farzan, J. Ian Munro
« Prev « First page 1960 / 2061 Last » Next »