3008 search results - page 386 / 602 » Independence in connected graphs |
190
Voted
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
—We consider the question of how a conspiring subgroup of peers in a p2p network can find each other and communicate without provoking suspicion among regular peers or an author...
211
Voted
DM
2000
15 years 6 months ago
2000
Erdos proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers. Generalized graph coloring d...
155
Voted
ICIP
2005
IEEE
16 years 8 months ago
2005
IEEE
In this paper, we present a novel algorithm for incremental principal component analysis. Based on the LargestEigenvalue-Theory, i.e. the eigenvector associated with the largest ei...
152
Voted
ICIP
2002
IEEE
16 years 8 months ago
2002
IEEE
JPEG2000 is a highly scalable compression standard, allowing access to image representations with a reduced resolution, a reduced quality or confined to a spatial region of intere...
171
Voted
VLSID
2004
IEEE
16 years 7 months ago
2004
IEEE
We consider the problem of minimizing the delay in signal transmission over point-to-point connections across multiple metal layers in a VLSI circuit. We present an exact solution...