2125 search results - page 280 / 425 » On Graph Complexity |
110
Voted
COLT
2010
Springer
14 years 8 months ago
2010
Springer
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...
103
Voted
INFOCOM
2010
IEEE
14 years 7 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...
CORR
2010
Springer
14 years 7 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...
76
Voted
TIT
2011
14 years 5 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 ...
97
Voted
AAAI
2011
13 years 10 months ago
2011
In this paper, we model the pair-wise similarities of a set of documents as a weighted network with a single cutoff parameter. Such a network can be thought of an ensemble of unwe...