3757 search results - page 27 / 752 » The overlap number of a graph |
ENDM
2007
13 years 8 months ago
2007
Providing a complete description of the stable set polytopes of claw-free graphs is a longstanding open problem since almost twenty years. Eisenbrandt et al. recently achieved a b...
ISAAC
2009
Springer
14 years 1 months ago
2009
Springer
For a connected graph G = (V, E), a subset U ⊆ V is called a k-cut if U disconnects G, and the subgraph induced by U contains exactly k (≥ 1) components. More specifically, a ...
AAAI
2010
13 years 8 months ago
2010
Multi-task learning aims at combining information across tasks to boost prediction performance, especially when the number of training samples is small and the number of predictor...
SP
2009
IEEE
14 years 3 months ago
2009
IEEE
Operators of online social networks are increasingly sharing potentially sensitive information about users and their relationships with advertisers, application developers, and da...
BC
1998
13 years 8 months ago
1998
In many cases the distribution of saccadic reaction times (SRT) deviates considerably from a unimodal distribution and may often exhibit several peaks. We present a statistical app...