581 search results - page 87 / 117 » Approximation algorithms for constructing wavelength routing... |
114
click to vote
MOBIHOC
2007
ACM
16 years 1 months ago
2007
ACM
We consider wireless ad hoc networks with a large number of users. Subsets of users might be interested in identical information, and so we have a regime in which several multicas...
109
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
148
click to vote
EMNLP
2006
15 years 2 months ago
2006
We propose a general method for reranker construction which targets choosing the candidate with the least expected loss, rather than the most probable candidate. Different approac...
118
click to vote
SPAA
2003
ACM
15 years 6 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
113
click to vote
TMC
2008
15 years 1 months ago
2008
We consider the problem of finding "backbones" in multihop wireless networks. The backbone provides end-toend connectivity, allowing non-backbone nodes to save energy sin...