4009 search results - page 581 / 802 » Clustering on Complex Graphs |
199
click to vote
INFOCOM
2010
IEEE
15 years 3 months ago
2010
IEEE
Information theoretic Broadcast Channels (BC) and Multiple Access Channels (MAC) enable a single node to transmit data simultaneously to multiple nodes, and multiple nodes to trans...
175
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
188
click to vote
TIT
2011
15 years 1 months ago
2011
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...
160
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
Temporal segmentation of facial gestures in spontaneous facial behavior recorded in real-world settings is an important, unsolved, and relatively unexplored problem in facial imag...
199
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
This paper considers the problem of identifying on the Web compound documents (cDocs) ? groups of web pages that in aggregate constitute semantically coherent information entities...