941 search results - page 13 / 189 » Efficient Testing of Large Graphs |
COLT
2004
Springer
15 years 3 months ago
2004
Springer
We consider the problem of labeling a partially labeled graph. This setting may arise in a number of situations from survey sampling to information retrieval to pattern recognition...
FORTE
1998
14 years 11 months ago
1998
In a testing environment, where an IUT communicates with multiple entities, a tester may have di ering degrees of controllability on the interactions between these entities and th...
ML
2008
ACM
14 years 9 months ago
2008
ACM
Abstract. We consider a large volume principle for transductive learning that prioritizes the transductive equivalence classes according to the volume they occupy in hypothesis spa...
EUROPAR
2007
Springer
15 years 1 months ago
2007
Springer
To understand the principles of information processing in the brain, we depend on models with more than 105 neurons and 109 connections. These networks can be described as graphs o...
COMGEO
2004
ACM
14 years 9 months ago
2004
ACM
We present a novel hierarchical force-directed method for drawing large graphs. Given a graph G = (V,E), the algorithm produces an embedding for G in an Euclidean space E of any d...