4007 search results - page 590 / 802 » Computation with imprecise probabilities |
139
click to vote
WWW
2006
ACM
16 years 5 months ago
2006
ACM
The increasing amount of communication between individuals in e-formats (e.g. email, Instant messaging and the Web) has motivated computational research in social network analysis...
141
click to vote
WWW
2005
ACM
16 years 5 months ago
2005
ACM
PageRank is defined as the stationary state of a Markov chain obtained by perturbing the transition matrix of a web graph with a damping factor that spreads part of the rank. The...
134
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
An affine disperser over Fn 2 for sources of dimension d is a function f : Fn 2 F2 such that for any affine space S Fn 2 of dimension at least d, we have {f(s) : s S} = F2. Aff...
KDD
2007
ACM
16 years 4 months ago
2007
ACM
This paper deals with detecting change of distribution in multi-dimensional data sets. For a given baseline data set and a set of newly observed data points, we define a statistic...
122
click to vote
KDD
2007
ACM
16 years 4 months ago
2007
ACM
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...