2304 search results - page 177 / 461 » On the Vulnerability of Large Graphs |
141
click to vote
DCOSS
2005
Springer
16 years 2 days ago
2005
Springer
We consider a scenario in which anonymous, finite-state sensing devices are deployed in an ad-hoc communication network of arbitrary size and unknown topology, and explore what p...
198
click to vote
DAGM
2008
Springer
15 years 8 months ago
2008
Springer
The design of inference algorithms for discrete-valued Markov Random Fields constitutes an ongoing research topic in computer vision. Large state-spaces, none-submodular energy-fun...
191
click to vote
COLING
2008
15 years 8 months ago
2008
We propose a new unsupervised method for topic detection that automatically identifies the different facets of an event. We use pointwise Kullback-Leibler divergence along with th...
176
click to vote
ICMLA
2008
15 years 8 months ago
2008
Dimension reduction techniques have been successfully applied to face recognition and text information retrieval. The process can be time-consuming when the data set is large. Thi...
176
click to vote
SDM
2008
SIAM
15 years 8 months ago
2008
SIAM
In this paper, we present a measure associated with detection and inference of statistically anomalous clusters of a graph based on the likelihood test of observed and expected ed...