2304 search results - page 331 / 461 » On the Vulnerability of Large Graphs |
APPROX
2009
Springer
15 years 4 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 ...
100
click to vote
COMPLEX
2009
Springer
15 years 4 months ago
2009
Springer
We derive variational equations to analyze the stability of synchronization for coupled near-identical oscillators. To study the effect of parameter mismatch on the stability in a ...
ISSAC
2009
Springer
15 years 4 months ago
2009
Springer
We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is represented as a black-box, i.e., by a functi...
FGR
2008
IEEE
15 years 4 months ago
2008
IEEE
This paper presents an algorithm for measuring hair and face appearance in 2D images. Our approach starts by using learned mixture models of color and location information to sugg...
126
click to vote
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
Local invariant feature based methods have been proven to be effective in computer vision for object recognition and learning. But for an image, the number of points detected and ...