4843 search results - page 383 / 969 » The Shortcut Problem - Complexity and Approximation |
145
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
We consider distributed algorithms to optimize random access multihop wireless networks in the presence of fading. Since the associated optimization problem is neither convex nor ...
186
click to vote
JMLR
2012
13 years 7 months ago
2012
In this paper, we propose a novel formulation of the network clique detection problem by introducing a general network data representation framework. We show connections between o...
182
Voted
ML
2008
ACM
15 years 4 months ago
2008
ACM
Feature selection is an important aspect of solving data-mining and machine-learning problems. This paper proposes a feature-selection method for the Support Vector Machine (SVM) l...
152
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
142
click to vote
TELETRAFFIC
2007
Springer
15 years 10 months ago
2007
Springer
We study the capacity allocation problem in service overlay networks (SON)s with state-dependent connection routing based on revenue maximization. We formulate the dimensioning pro...