1538 search results - page 116 / 308 » Spectral Techniques in Graph Algorithms |
137
click to vote
SIGMOD
2010
ACM
14 years 12 months ago
2010
ACM
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
129
click to vote
ICPP
2002
IEEE
15 years 6 months ago
2002
IEEE
Power aware computing has become popular recently and many techniques have been proposed to manage the energy consumption for traditional real-time applications. We have previousl...
135
click to vote
ISBI
2009
IEEE
15 years 8 months ago
2009
IEEE
Biological images have the potential to reveal complex signatures that may not be amenable to morphological modeling in terms of shape, location, texture, and color. An effective ...
121
click to vote
MFCS
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
134
click to vote
ICIP
2007
IEEE
16 years 3 months ago
2007
IEEE
In this paper, we present a novel active contour model, in which the traditional gradient descent optimization is replaced by graph cut optimization. The basic idea is to first de...