745 search results - page 129 / 149 » On Generating Random Network Structures: Connected Graphs |
151
click to vote
UAI
2008
15 years 1 months ago
2008
Numerous temporal inference tasks such as fault monitoring and anomaly detection exhibit a persistence property: for example, if something breaks, it stays broken until an interve...
TON
2010
14 years 10 months ago
2010
Abstract—Comparing graphs to determine the level of underlying structural similarity between them is a widely encountered problem in computer science. It is particularly relevant...
123
Voted
SUTC
2008
IEEE
15 years 6 months ago
2008
IEEE
Most of research efforts have elaborated on k-anonymity for location privacy. The general architecture for implementing k-anonymity is that there is one trusted server (referred t...
134
click to vote
BMCBI
2010
15 years 17 days ago
2010
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
113
click to vote
AAAI
2012
13 years 2 months ago
2012
Current computer involvement in adolescent social networks (youth between the ages of 11 and 17) provides new opportunities to study group dynamics, interactions amongst peers, an...