Sciweavers

15033 search results - page 364 / 3007
» Complexity Theory and Algorithms
Sort
View
WSCG
2004
148views more  WSCG 2004»
15 years 8 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
209
Voted
DIAL
2004
IEEE
136views Image Analysis» more  DIAL 2004»
15 years 11 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
181
Voted
CORR
2011
Springer
188views Education» more  CORR 2011»
15 years 2 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
2004
ACM
158views Algorithms» more  STOC 2004»
16 years 7 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
STOC
2002
ACM
149views Algorithms» more  STOC 2002»
16 years 7 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