630 search results - page 29 / 126 » Hardness results for approximating the bandwidth |
118
click to vote
ICC
2009
IEEE
14 years 10 months ago
2009
IEEE
Abstract-- This paper addresses the problem of traffic grooming in WDM rings in which all traffic emanates from a single node and all other nodes are destination nodes. This "...
83
Voted
NIPS
2007
15 years 1 months ago
2007
In many structured prediction problems, the highest-scoring labeling is hard to compute exactly, leading to the use of approximate inference methods. However, when inference is us...
105
click to vote
VLSID
2006
IEEE
16 years 26 days ago
2006
IEEE
Serial links in network on chip provide advantages in terms of reduced wiring area, reduced switch complexity and power. However, serial links offer lower bandwidth in comparison ...
89
Voted
JCB
2007
15 years 12 days ago
2007
In this paper, we study the problem of computing the similarity of two protein structures ring their contact-map overlap. Contact-map overlap abstracts the problem of computing th...
115
click to vote
COCO
2004
Springer
15 years 4 months ago
2004
Springer
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...