828 search results - page 9 / 166 » Simplicial Powers of Graphs |
ASWEC
2008
IEEE
14 years 1 months ago
2008
IEEE
A software component graph, where a node represents a component and an edge represents a use-relation between components, is widely used for analysis methods of software engineeri...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
Mode-seeking has been widely used as a powerful data analysis technique for clustering and filtering in a metric feature space. We introduce a versatile and efficient modeseekin...
COCOON
2005
Springer
14 years 1 months ago
2005
Springer
To monitor an electric power system by placing as few phase measurement units (PMUs) as possible is closely related to the famous vertex cover problem and domination problem in gr...
SIROCCO
2008
13 years 9 months ago
2008
We consider a network represented by a simple connected undirected graph with N anonymous nodes that have local orientations, i.e. incident edges of each vertex have locally-unique...