11381 search results - page 327 / 2277 » Connectivity |
154
click to vote
SIAMDM
2010
15 years 5 months ago
2010
A connected graph G is called t-perfect if its stable set polytope is determined by the non-negativity, edge and odd-cycle inequalities. Moreover, G is called strongly t-perfect i...
147
click to vote
ICPR
2010
IEEE
15 years 4 months ago
2010
IEEE
This paper presents the binary flattenings of shapes, first as a connected operator suppressing particles or holes, second as an erosion in a particular lattice of shapes. Using t...
200
click to vote
SECON
2010
IEEE
15 years 4 months ago
2010
IEEE
In a wireless sensor network, short range multihop transmissions are preferred to prolong the network lifetime due to super-linear nature of energy consumption with communication d...
191
click to vote
ANCS
2009
ACM
15 years 4 months ago
2009
ACM
Ubiquitous multi-core-based web servers and edge routers are increasingly popular in deploying computationally intensive Deep Packet Inspection (DPI) programs. Previous work has s...
176
click to vote
MICCAI
2007
Springer
16 years 7 months ago
2007
Springer
In functional connectivity analysis, networks of interest are defined based on correlation with the mean time course of a user-selected `seed' region. In this work we propose ...