4009 search results - page 400 / 802 » Clustering on Complex Graphs |
198
click to vote
DBSEC
2009
15 years 8 months ago
2009
Managing the configuration of heterogeneous enterprise security mechanisms is a wholly complex task. The effectiveness of a configuration may be constrained by poor understanding a...
167
click to vote
FSTTCS
2008
Springer
15 years 8 months ago
2008
Springer
We consider an extension of Church’s synthesis problem to ordinals by adding limit transitions to graph games. We consider game arenas where these limit transitions are defined...
184
click to vote
ICASSP
2010
IEEE
15 years 7 months ago
2010
IEEE
Recently, the Sparse Matrix Transform (SMT) has been proposed as a tool for estimating the eigen-decomposition of high dimensional data vectors [1]. The SMT approach has two major...
165
click to vote
DAM
2008
15 years 7 months ago
2008
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
205
click to vote
PAMI
2006
15 years 6 months ago
2006
Efficient segmentation of globally optimal surfaces representing object boundaries in volumetric data sets is important and challenging in many medical image analysis applications....