Sciweavers

15033 search results - page 361 / 3007
» Complexity Theory and Algorithms
Sort
View
SIVP
2008
92views more  SIVP 2008»
15 years 7 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...
GEOS
2007
Springer
16 years 1 months ago
Algorithm, Implementation and Application of the SIM-DL Similarity Server
Abstract. Semantic similarity measurement gained attention as a methodology for ontology-based information retrieval within GIScience over the last years. Several theories explain ...
Krzysztof Janowicz, Carsten Keßler, Mirco Sc...
RSA
2002
99views more  RSA 2002»
15 years 6 months ago
Distributed algorithms with dynamical random transitions
Given any measure-preserving dynamical system (Y, A , , T) and g Lp() , we study convergence of the sequence 1 n n k=1 g TSk , n 1 where Sk is a dynamic Zr -valued random w...
Nadine Guillotin-Plantard, René Schott
CORR
2004
Springer
116views Education» more  CORR 2004»
15 years 7 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...
ECCC
2010
95views more  ECCC 2010»
15 years 4 months ago
On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography
The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture that such systems do not exist. Kraj
Edward A. Hirsch, Dmitry Itsykson, Ivan Monakhov, ...