2304 search results - page 270 / 461 » On the Vulnerability of Large Graphs |
164
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
In this paper we present a dynamic model for simulating face aging process. We adopt a high resolution grammatical face model[1] and augment it with age and hair features. This mo...
355
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
196
click to vote
CIE
2007
Springer
16 years 24 days ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
171
click to vote
SIGECOM
2006
ACM
16 years 17 days ago
2006
ACM
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
260
click to vote
FCA
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. A main goal of Formal Concept Analysis from its very beginning has been the support of rational communication. The source of this goal lies in our understanding of mathem...