270 search results - page 7 / 54 » Properties of Almost All Graphs and Generalized Quantifiers |
KDID
2004
13 years 8 months ago
2004
Emerging patterns (EPs) are associations of features whose frequencies increase significantly from one class to another. They have been proven useful to build powerful classifiers ...
STACS
2001
Springer
13 years 11 months ago
2001
Springer
We prove new results on evasiveness of monotone graph properties by extending the techniques of Kahn, Saks, and Sturtevant [Combinatorica, 4 (1984), pp. 297–306]. For the propert...
PAMI
2007
13 years 6 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
SIAMREV
2010
13 years 2 months ago
2010
The newly emerging field of Network Science deals with the tasks of modelling, comparing and summarizing large data sets that describe complex interactions. Because pairwise affin...
JSYML
2010
13 years 2 months ago
2010
A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct ver...