204 search results - page 11 / 41 » Testing Triangle-Freeness in General Graphs |
STOC
2007
ACM
14 years 8 months ago
2007
ACM
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
ACMSE
2005
ACM
14 years 1 months ago
2005
ACM
Recent research suggests that most of the real-world random networks organize themselves into communities. Communities are formed by subsets of nodes in a graph, which are closely...
DAC
2009
ACM
14 years 2 months ago
2009
ACM
For a computing system to be trusted, it is equally important to verify that the system performs no more and no less functionalities than desired. Traditional testing and verifica...
ISAAC
2007
Springer
14 years 1 months ago
2007
Springer
We introduces the umodules, a generalization of the notion of graph module. The theory we develop captures among others undirected graphs, tournaments, digraphs, and 2−structures...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
We present a new approach for the incorporation of shape information into a segmentation algorithm. Unlike previous approaches to the problem, our method requires no initializatio...