Sciweavers

16666 search results - page 2999 / 3334
» Descriptive and Computational Complexity
Sort
View
CNSM
2010
15 years 1 months ago
Capacity planning and power management to exploit sustainable energy
This paper describes an approach for designing a power management plan that matches the supply of power with the demand for power in data centers. Power may come from the grid, fro...
Daniel Gmach, Jerry Rolia, Cullen Bash, Yuan Chen,...
PAMI
2011
15 years 1 months ago
Decoupled Active Contour (DAC) for Boundary Detection
— The accurate detection of object boundaries via active contours is an ongoing research topic in computer vision. Most active contours converge towards some desired contour by m...
Akshaya Kumar Mishra, Paul W. Fieguth, David A. Cl...
RTS
2011
123views more  RTS 2011»
15 years 1 months ago
Feasibility analysis under fixed priority scheduling with limited preemptions
—Preemptive scheduling often generates a significant runtime overhead that may increase task worst-case execution times up to 40%, with respect to a fully non preemptive executi...
Gang Yao, Giorgio C. Buttazzo, Marko Bertogna
TCOM
2011
92views more  TCOM 2011»
15 years 1 months ago
Bit-Interleaved Coded Modulation with Mismatched Decoding Metrics
Bit-interleaved coded modulation (BICM) has become the de facto coding standard for communication systems. Recently, BICM has been cast as a mismatched decoding scheme due to the ...
Trung Thanh Nguyen 0001, Lutz H.-J. Lampe
TIT
2011
131views more  TIT 2011»
15 years 1 months ago
On the Hardness of Approximating the Network Coding Capacity
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 ...
Michael Langberg, Alexander Sprintson
« Prev « First page 2999 / 3334 Last » Next »