Sciweavers

1695 search results - page 235 / 339
» Linear, Polynomial or Exponential
Sort
View
APPROX
2009
Springer
149views Algorithms» more  APPROX 2009»
15 years 11 months ago
On the Complexity of the Asymmetric VPN Problem
We give the first constant factor approximation algorithm for the asymmetric Virtual Private Network (Vpn) problem with arbitrary concave costs. We even show the stronger result, ...
Thomas Rothvoß, Laura Sanità
PIMRC
2008
IEEE
15 years 10 months ago
An optimization framework for the joint routing and scheduling in Wireless Mesh Networks
—In this paper, we address the problem of computing the transport capacity of Wireless Mesh Networks dedicated to Internet access. Routing and transmission scheduling have a majo...
Christelle Molle, Fabrice Peix, Hervé Rivan...
SMC
2007
IEEE
133views Control Systems» more  SMC 2007»
15 years 10 months ago
Text classification using multi-word features
—We carried out a series of experiments on text classification using multi-word features. An automated method was proposed to extract the multi-words from text data set and two d...
Wen Zhang, Taketoshi Yoshida, Xijin Tang
FSTTCS
2007
Springer
15 years 10 months ago
Undirected Graphs of Entanglement 2
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
Walid Belkhir, Luigi Santocanale
HPCC
2007
Springer
15 years 10 months ago
Optimizing Performance of Automatic Training Phase for Application Performance Prediction in the Grid
Abstract. Automatic execution time prediction of the Grid applications plays a critical role in making the pervasive Grid more reliable and predictable. However, automatic executio...
Farrukh Nadeem, Radu Prodan, Thomas Fahringer