436 search results - page 36 / 88 » Recursion and Complexity |
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
We study efficient algorithms for soft-input soft-output (SISO) encoding of convolutional codes. While the BCJR algorithm has been suggested for SISO encoding, we show that a for...
197
click to vote
POPL
2008
ACM
16 years 2 months ago
2008
ACM
The proofs of major results of Computability Theory like Rice, Rice-Shapiro or Kleene's fixed point theorem hide more information of what is usually expressed in their respec...
107
click to vote
PODS
2005
ACM
16 years 2 months ago
2005
ACM
We study the satisfiability problem associated with XPath in the presence of DTDs. This is the problem of determining, given a query p in an XPath fragment and a DTD D, whether or...
ACSC
2004
IEEE
15 years 6 months ago
2004
IEEE
Matrix multiplication is a basic computing operation. Whereas it is basic, it is also very expensive with a straight forward technique of O(N3 ) runtime complexity. More complex s...
111
Voted
HICSS
2006
IEEE
15 years 8 months ago
2006
IEEE
Digital government is a complex organizational and social phenomenon. It involves technical, organizational, and policy elements, as well as their complex and recursive interactio...