5606 search results - page 273 / 1122 » Randomization Techniques for Graphs. |
184
click to vote
CIAC
2006
Springer
15 years 10 months ago
2006
Springer
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
166
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
The study of networked systems is an emerging field, impacting almost every area of engineering and science, including the important domains of communication systems, biology, soc...
187
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
176
click to vote
ICPR
2000
IEEE
16 years 7 months ago
2000
IEEE
Speech can be represented as a time/frequency distribution of energy using a multi-band filter bank. A Markov random field model, which takes into account the possible time asynch...
141
click to vote
MICCAI
2009
Springer
16 years 3 months ago
2009
Springer
The measure of lumen volume on radial arteries can be used to evaluate the vessel response to different vasodilators. In this paper, we present a framework for automatic lumen segm...