2957 search results - page 267 / 592 » The Complexity of Polynomial-Time Approximation |
225
click to vote
ECRTS
2009
IEEE
15 years 4 months ago
2009
IEEE
Allocation of bandwidth among components is a fundamental problem in compositional real-time systems. Stateof-the-art algorithms for bandwidth allocation use either exponential-ti...
192
click to vote
TIT
2011
15 years 1 months ago
2011
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...
212
click to vote
TNN
2010
15 years 1 months ago
2010
Abstract--Recently, sparse approximation has become a preferred method for learning large scale kernel machines. This technique attempts to represent the solution with only a subse...
207
click to vote
TON
2010
15 years 1 months ago
2010
This paper presents Interleaved Stratified Timer Wheels as a novel priority queue data structure for traffic shaping and scheduling in packet-switched networks. The data structure ...
190
click to vote
VC
2010
15 years 1 months ago
2010
Abstract Three-dimensional (3D) representations of complex geometric shapes, especially when they are reconstructed from magnetic resonance imaging (MRI) and computed tomography (C...