941 search results - page 67 / 189 » Efficient Testing of Large Graphs |
ICCV
2007
IEEE
15 years 11 months ago
2007
IEEE
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...
ICMLA
2008
14 years 11 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...
SDM
2008
SIAM
14 years 11 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...
CVPR
2006
IEEE
15 years 11 months ago
2006
IEEE
This paper presents a new volumetric stereo algorithm to reconstruct the 3D shape of an arbitrary object. Our method is based on finding the minimum cut in an octahedral graph str...
FASE
2006
Springer
15 years 1 months ago
2006
Springer
We present an algorithm for automatic testing of distributed programs, such as Unix processes with inter-process communication and Web services. Specifically, we assume that a prog...