Sciweavers

42230 search results - page 402 / 8446
» Algorithms and Complexity Results for
Sort
View
EOR
2008
69views more  EOR 2008»
15 years 7 months ago
On the complexity of optimization over the standard simplex
We review complexity results for minimizing polynomials over the standard simplex and unit hypercube. In addition, we derive new results on the computational complexity of approxi...
E. de Klerk, Dick den Hertog, G. Elabwabi
CORR
2004
Springer
116views Education» more  CORR 2004»
15 years 6 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»
15 years 5 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»
15 years 1 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
COGSCI
2010
87views more  COGSCI 2010»
15 years 7 months ago
An On-Line Study of Japanese Nesting Complexity
This paper reports the results of a self-paced reading experiment in Japanese in which the materials consisted of four versions of successively more nested syntactic structures. I...
Kentaro Nakatani, Edward Gibson