820 search results - page 76 / 164 » Inducing Temporal Graphs |
138
click to vote
ICIP
2007
IEEE
15 years 9 months ago
2007
IEEE
Graph cut image segmentation with intensity information alone is prone to fail for objects with weak edges, in clutter, or under occlusion. Existing methods to incorporate shape a...
114
Voted
GG
2004
Springer
15 years 8 months ago
2004
Springer
that graph transformations provide the right level of abstraction, and useful technical tools for studying gene assembly. On the other hand, the gene assembly process inspires a ne...
127
Voted
ESA
2006
Springer
15 years 6 months ago
2006
Springer
We consider the following vertex coloring problem. We are given an undirected graph G = (V, E), where each vertex v is associated with a penalty rejection cost rv. We need to choos...
117
Voted
IPL
2008
15 years 2 months ago
2008
A hub set in a graph G is a set U V (G) such that any two vertices outside U are connected by a path whose internal vertices lie in U. We prove that h(G) hc(G) c(G) h(G) + 1, ...
143
Voted
IJSNET
2007
15 years 2 months ago
2007
: Robustness and security of services like localisation, routing and time synchronisation in Wireless Sensor Networks (WSNs) have been critical issues. Efficient mathematical (gra...