779 search results - page 20 / 156 » Algorithms for the Sample Mean of Graphs |
KDD
2003
ACM
15 years 10 months ago
2003
ACM
Data Mining with Bayesian Network learning has two important characteristics: under broad conditions learned edges between variables correspond to causal influences, and second, f...
PAKDD
2010
ACM
15 years 2 months ago
2010
ACM
In this work, we investigate the use of online or “crawling” algorithms to sample large social networks in order to determine the most influential or important individuals wit...
171
click to vote
GIS
2009
ACM
15 years 10 months ago
2009
ACM
Map-matching is the process of aligning a sequence of observed user positions with the road network on a digital map. It is a fundamental pre-processing step for many applications...
IMC
2009
ACM
15 years 4 months ago
2009
ACM
We show that currently prevalent practices for network path measurements can produce inaccurate inferences because of sampling biases. The inferred mean path latency can be more t...
ICIP
2007
IEEE
15 years 4 months ago
2007
IEEE
The geometric features of images, such as edges, are difficult to represent. When a redundant transform is used for their extraction, the compression challenge is even more dif...