1756 search results - page 107 / 352 » Directed scale-free graphs |
AGTIVE
2003
Springer
14 years 1 months ago
2003
Springer
OptimixJ is a graph rewrite tool that can be embedded easily into the standard software process. Applications and models can be developed in Java or UML and extended by graph rewri...
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
CVPR
2005
IEEE
14 years 10 months ago
2005
IEEE
The recent explosion of interest in graph cut methods in computer vision naturally spawns the question: what energy functions can be minimized via graph cuts? This question was fi...
COSIT
2009
Springer
14 years 2 months ago
2009
Springer
Conceptual neighborhood graphs are similarity-based schemata of spatial/temporal relations. This paper proposes a semi-automated method for deriving a conceptual neighborhood graph...
ICDM
2008
IEEE
14 years 2 months ago
2008
IEEE
Nonnegative matrix factorization (NMF) is a versatile model for data clustering. In this paper, we propose several NMF inspired algorithms to solve different data mining problems....