Sciweavers

2333 search results - page 183 / 467
» Recursive Computational Depth
Sort
View
119
Voted
ICALP
2003
Springer
15 years 7 months ago
Sophistication Revisited
Kolmogorov complexity measures the ammount of information in a string as the size of the shortest program that computes the string. The Kolmogorov structure function divides the s...
Luis Antunes 0002, Lance Fortnow
107
Voted
JSAC
1998
136views more  JSAC 1998»
15 years 2 months ago
Concatenated Decoding with a Reduced-Search BCJR Algorithm
—We apply two reduced-computation variants of the BCJR algorithm to the decoding of serial and parallel concatenated convolutional codes. One computes its recursions at only M st...
Volker Franz, John B. Anderson
AMC
2006
117views more  AMC 2006»
15 years 2 months ago
The case for hypercomputation
The weight of evidence supporting the case for hypercomputation is compelling. We examine some 20 physical and mathematical models of computation that are either known or suspecte...
Mike Stannett
130
Voted
CAGD
2002
156views more  CAGD 2002»
15 years 2 months ago
Explicit matrix representation for NURBS curves and surfaces
The matrix forms for curves and surfaces were largely promoted in CAD/CAM. In this paper we have presented two matrix representation formulations for arbitrary degree NURBS curves...
Ligang Liu, Guojin Wang
116
Voted
DMTCS
2010
416views Mathematics» more  DMTCS 2010»
14 years 11 months ago
Continued fraction expansions for q-tangent and q-cotangent functions
Abstract. For 3 different versions of q-tangent resp. q-cotangent functions, we compute the continued fraction expansion explicitly, by guessing the relative quantities and proving...
Helmut Prodinger