499 search results - page 38 / 100 » Multilevel algorithms for linear ordering problems |
137
click to vote
ICALP
2011
Springer
14 years 5 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
135
click to vote
CDC
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract— Many problems associated with networked systems can be formulated as network utility maximization (NUM) problems. NUM problems maximize a global separable measure of ne...
134
click to vote
JSAC
2008
15 years 1 months ago
2008
A cognitive radio (CR) network is often described as a secondary network operating in a frequency band originally licensed/allocated to a primary network consisting of one or multi...
119
Voted
SODA
2010
ACM
15 years 11 months ago
2010
ACM
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
157
click to vote
TASLP
2011
14 years 8 months ago
2011
Abstract—The shifted delta cepstrum (SDC) is a widely used feature extraction for language recognition (LRE). With a high context width due to incorporation of multiple frames, S...