2531 search results - page 7 / 507 » Group testing in graphs |
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
Recent work has shown that one can learn the structure of Gaussian Graphical Models by imposing an L1 penalty on the precision matrix, and then using efficient convex optimization...
ARSCOM
2005
13 years 7 months ago
2005
Can an arbitrary graph be embedded in Euclidean space so that the isometry group of its vertex set is precisely its graph automorphism group? This paper gives an affirmative answe...
MBEES
2008
13 years 9 months ago
2008
: In this paper, we discuss adjustable coverage criteria and their combinations in model-based testing. We formalize coverage criteria and specify test goals using OCL. Then, we pr...
ESA
2010
Springer
13 years 8 months ago
2010
Springer
Minor containment is a fundamental problem in Algorithmic Graph Theory, as numerous graph algorithms use it as a subroutine. A model of a graph H in a graph G is a set of disjoint ...
FM
2005
Springer
14 years 1 months ago
2005
Springer
Abstract Colin Campbell, Wolfgang Grieskamp, Lev Nachmanson, Wolfram Schulte, Nikolai Tillmann, and Margus Veanes Microsoft Research, Redmond, WA, USA Abstract. We describe a pract...