Sciweavers

10608 search results - page 90 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
GLOBECOM
2007
IEEE
13 years 11 months ago
Optimal Downlink OFDMA Subcarrier, Rate, and Power Allocation with Linear Complexity to Maximize Ergodic Weighted-Sum Rates
Abstract— In this paper, we propose a resource allocation algorithm for ergodic weighted-sum rate maximization in downlink OFDMA systems. In contrast to most previous research tha...
Ian C. Wong, Brian L. Evans
WSCG
2004
148views more  WSCG 2004»
13 years 11 months ago
Inverse Rendering of Polished Materials under Constant Complex Uncontrolled Illumination
Inverse rendering infers realistic descriptions of illumination and material properties from photographs. However, the applicability of state of the art inverse rendering algorith...
Michael Bang Nielsen, Anders Brodersen
DIAL
2004
IEEE
136views Image Analysis» more  DIAL 2004»
14 years 1 months ago
Line Separation for Complex Document Images Using Fuzzy Runlength
A new text line location and separation algorithm for complex handwritten documents is proposed. The algorithm is based on the application of a fuzzy directional runlength. The pr...
Zhixin Shi, Venu Govindaraju
CORR
2011
Springer
188views Education» more  CORR 2011»
13 years 5 months ago
On the Decoding Complexity of Cyclic Codes Up to the BCH Bound
—The standard algebraic decoding algorithm of cyclic codes [n, k, d] up to the BCH bound t is very efficient and practical for relatively small n while it becomes unpractical fo...
Davide Schipani, Michele Elia, Joachim Rosenthal
STOC
2002
ACM
149views Algorithms» more  STOC 2002»
14 years 10 months ago
The complexity of choosing an H-colouring (nearly) uniformly at random
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
Leslie Ann Goldberg, Steven Kelk, Mike Paterson