Sciweavers

10608 search results - page 87 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
SIVP
2008
92views more  SIVP 2008»
13 years 10 months ago
Reduced decoder complexity and latency in pixel-domain Wyner-Ziv video coders
In some video coding applications, it is desirable to reduce the complexity of the video encoder at the expense of a more complex decoder. Wyner
Marleen Morbée, Antoni Roca, Josep Prades-N...
CORR
2004
Springer
116views Education» more  CORR 2004»
13 years 10 months ago
Two Methods for Decreasing the Computational Complexity of the MIMO ML Decoder
We propose use of QR decomposition with sort and Dijkstra's algorithm for decreasing the computational complexity of the sphere decoder that is used for ML detection of signa...
Takayuki Fukatani, Ryutaroh Matsumoto, Tomohiko Uy...
JACM
2010
116views more  JACM 2010»
13 years 8 months ago
The complexity of temporal constraint satisfaction problems
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
Manuel Bodirsky, Jan Kára
TIT
2010
107views Education» more  TIT 2010»
13 years 4 months ago
Rate distortion and denoising of individual data using Kolmogorov complexity
We examine the structure of families of distortion balls from the perspective of Kolmogorov complexity. Special attention is paid to the canonical rate-distortion function of a so...
Nikolai K. Vereshchagin, Paul M. B. Vitányi
COMPGEOM
2010
ACM
14 years 3 months ago
Better bounds on the union complexity of locally fat objects
We prove that the union complexity of a set of n constantcomplexity locally fat objects (which can be curved and/or non-convex) in the plane is O(λt+2(n) log n), where t is the m...
Mark de Berg