1127 search results - page 125 / 226 » Testing the Expansion of a Graph |
139
click to vote
IJCV
2006
14 years 10 months ago
2006
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
CORR
2011
Springer
14 years 5 months ago
2011
Springer
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...
118
click to vote
SOQUA
2007
14 years 11 months ago
2007
When choosing a testing technique, practitioners want to know which one will detect the faults that matter most to them in the programs that they plan to test. Do empirical evalua...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
A plethora of random graph models have been developed in recent years to study a range of problems on networks, driven by the wide availability of data from many social, telecommu...
108
click to vote
AGTIVE
2003
Springer
15 years 3 months ago
2003
Springer
Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of bal...