779 search results - page 24 / 156 » Algorithms for the Sample Mean of Graphs |
ICCV
2003
IEEE
15 years 11 months ago
2003
IEEE
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...
FSTTCS
2007
Springer
15 years 3 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
ICIP
2006
IEEE
15 years 11 months ago
2006
IEEE
A computationally efficient algorithm is proposed to remove noise impulses from speech and audio signals while retaining its features and tonal quality. The proposed method is bas...
CAS
2008
14 years 10 months ago
2008
In this paper we first present a novel approach to determine the structural information content (graph entropy) of a network represented by an undirected and connected graph. Such...
BMCBI
2008
14 years 10 months ago
2008
Background: Choosing the appropriate sample size is an important step in the design of a microarray experiment, and recently methods have been proposed that estimate sample sizes ...