966 search results - page 17 / 194 » Small Alliances in Graphs |
APPROX
2009
Springer
14 years 3 months ago
2009
Springer
Recently, Hazan and Krauthgamer showed [12] that if, for a fixed small ε, an ε-best ε-approximate Nash equilibrium can be found in polynomial time in two-player games, then it ...
CONNECTION
2006
13 years 8 months ago
2006
Models of associative memory usually have full connectivity or if diluted, random symmetric connectivity. In contrast, biological neural systems have predominantly local, non-symm...
MICCAI
2010
Springer
13 years 7 months ago
2010
Springer
International Conference on Medical Image Computing and Computer Assisted Intervention, Beijing, China, 20-24 September 2010 Extracting numerous cells in a large microscopic image...
SIGMOD
2012
ACM
11 years 11 months ago
2012
ACM
Most of the existing reachability indices perform well on small- to medium- size graphs, but reach a scalability bottleneck around one million vertices/edges. As graphs become inc...
DAC
2001
ACM
14 years 9 months ago
2001
ACM
Highlighted with the newly released intellectual property (IP) protection white paper by VSI Alliance, the protection of virtual components (VCs) has received a large amount of at...