2531 search results - page 20 / 507 » Group testing in graphs |
151
click to vote
SIGCOMM
1998
ACM
15 years 8 months ago
1998
ACM
Many emerging applications (e.g., teleconference, real-time information services, pay per view, distributed interactive simulation, and collaborative work) are based upon a group ...
142
click to vote
GBRPR
2007
Springer
15 years 10 months ago
2007
Springer
We introduce a method for computing homology groups and their generators of a 2D image, using a hierarchical structure i.e. irregular graph pyramid. Starting from an image, a hiera...
135
click to vote
SAC
2009
ACM
15 years 11 months ago
2009
ACM
This paper introduces LDA-G, a scalable Bayesian approach to finding latent group structures in large real-world graph data. Existing Bayesian approaches for group discovery (suc...
141
click to vote
EJC
2010
15 years 4 months ago
2010
Let X = (V, E) be a finite simple connected graph with n vertices and m edges. A configuration is an assignment of one of two colors, black or white, to each edge of X. A move app...
153
click to vote
CN
2008
15 years 4 months ago
2008
Failure resilience is a desired feature of the Internet. Most traditional restoration architectures assume single-failure assumption, which is not adequate in present day WDM opti...