540 search results - page 94 / 108 » New bounds on the edge number of a k-map graph |
KDD
2007
ACM
14 years 8 months ago
2007
ACM
Correlation mining has gained great success in many application domains for its ability to capture the underlying dependency between objects. However, the research of correlation ...
LPAR
2004
Springer
14 years 29 days ago
2004
Springer
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
WEA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...
SIGMOD
2008
ACM
14 years 7 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...
ICIP
2009
IEEE
14 years 5 months ago
2009
IEEE
In this paper, we consider the colorization problem of grayscale images in which some color scribbles are initially given. Our proposed method is based on the weighted color blendi...