572 search results - page 99 / 115 » Exponential-Time Approximation of Hard Problems |
PODC
2005
ACM
15 years 3 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
INFOCOM
2003
IEEE
15 years 3 months ago
2003
IEEE
— We study problems related to supporting multicast connections with Quality of Service (QoS) requirements. We investigate the problem of optimal resource allocation in the conte...
STOC
2009
ACM
15 years 10 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...
KDD
2009
ACM
15 years 10 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 ...
134
click to vote
RECOMB
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. In this study we propose a novel model for the representation of biological networks and provide algorithms for learning model parameters from experimental data. Our appr...