Sciweavers

436 search results - page 39 / 88
» Recursion and Complexity
Sort
View
JAR
1998
60views more  JAR 1998»
13 years 7 months ago
Elimination of Self-Resolving Clauses
It is shown how self-resolving clauses like symmetry or transitivity, or even clauses like condensed detachment, can faithfully be deleted from the clause set thus eliminating or ...
Hans Jürgen Ohlbach
CORR
2011
Springer
173views Education» more  CORR 2011»
13 years 2 months ago
Linear Dependent Types and Relative Completeness
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
Ugo Dal Lago, Marco Gaboardi
CORR
2010
Springer
82views Education» more  CORR 2010»
13 years 5 months ago
Computing (or not) Quasi-Periodicity Functions of Tilings
Abstract. We know that tilesets that can tile the plane always admit a quasiperiodic tiling [4, 8], yet they hold many uncomputable properties [3, 11, 21, 25]. The quasi-periodicit...
Alexis Ballier, Emmanuel Jeandel
VTC
2006
IEEE
115views Communications» more  VTC 2006»
14 years 1 months ago
Suboptimal Maximum Likelihood Detection Using Gradient-based Algorithm for MIMO Channels
Abstract— This paper proposes a suboptimal maximum likelihood detection (MLD) algorithm for multiple-input multipleoutput (MIMO) communications. The proposed algorithm regards tr...
Thet Htun Khine, Kazuhiko Fukawa, Hiroshi Suzuki
CORR
2008
Springer
86views Education» more  CORR 2008»
13 years 8 months ago
Fast computation of the median by successive binning
In many important problems, one uses the median instead of the mean to estimate a population's center, since the former is more robust. But in general, computing the median i...
Ryan J. Tibshirani