1941 search results - page 104 / 389 » On Generalizations of Network Design Problems with Degree Bo... |
153
click to vote
GLVLSI
2003
IEEE
15 years 11 months ago
2003
IEEE
In this work we ask the fundamental question: How many bits of information can be stored in a crossbar switching network? The answer is trivial when the switches of the network ar...
155
click to vote
INFOCOM
2008
IEEE
16 years 18 days ago
2008
IEEE
— While the practical coding scheme [1] has been shown to be able to improve throughput of wireless networks, there still lacks fundamental understanding on how the coding scheme...
164
click to vote
TALG
2010
15 years 4 months ago
2010
We study the lower-bounded facility location problem, which generalizes the classical uncapacitated facility location problem in that it comes with lower bound constraints for the...
165
click to vote
FOCS
2006
IEEE
16 years 7 days ago
2006
IEEE
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
166
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In their paper on the "chasm at depth four", Agrawal and Vinay have shown that polynomials in m variables of degree O(m) which admit arithmetic circuits of size 2o(m) al...