16430 search results - page 581 / 3286 » On Computable Tree Functions |
171
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Using the concept of discrete noiseless channels, it was shown by Shannon in A Mathematical Theory of Communication that the ultimate performance of an encoder for a constrained sy...
190
click to vote
CDC
2009
IEEE
15 years 5 months ago
2009
IEEE
Change detection problems are ubiquitous, but there are no existing tractable techniques for -exact solution of discrete-time, discrete-observation problems. A polynomialtime algor...
201
click to vote
ICML
2007
IEEE
16 years 8 months ago
2007
IEEE
Increasingly large collections of structured data necessitate the development of efficient, noise-tolerant retrieval tools. In this work, we consider this issue and describe an ap...
132
click to vote
FPL
2005
Springer
16 years 19 days ago
2005
Springer
SRAM-based FPGAs have an inherent capacity for defect tolerance. We propose a simple scheme that exploits this potential in multiple-FPGA systems. The symmetry of the system is ex...
211
click to vote
LICS
1997
IEEE
15 years 10 months ago
1997
IEEE
Fixpoint expressions built from functional signatures interpreted over arbitrary complete lattices are considered. A generic notionof automatonis defined and shown, by means of a ...