630 search results - page 95 / 126 » Hardness results for approximating the bandwidth |
164
click to vote
INFOCOM
2006
IEEE
16 years 4 days ago
2006
IEEE
— We study the complexity of a spectrum of design problems for optical networks in order to carry a set of demands. Under wavelength division multiplexing (WDM) technology, deman...
138
click to vote
WADS
2001
Springer
15 years 10 months ago
2001
Springer
This paper investigates the problem of time-optimum movement planning in two and three dimensions for a point robot which has bounded control velocity through a set of n polygonal...
200
click to vote
SIGMOD
2011
ACM
14 years 9 months ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
167
click to vote
STOC
2009
ACM
16 years 6 months ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
163
click to vote
KDD
2009
ACM
16 years 6 months ago
2009
ACM
Labeling text data is quite time-consuming but essential for automatic text classification. Especially, manually creating multiple labels for each document may become impractical ...