Sciweavers

428 search results - page 19 / 86
» Completeness of a Fact Extractor
Sort
View
FPL
1998
Springer
135views Hardware» more  FPL 1998»
15 years 1 months ago
Designing for Xilinx XC6200 FPGAs
With the XC6200 FPGA Xilinx introduced the first commercially available FPGA designed for reconfigurable computing. It has a completely new internal architecture, so new design alg...
Reiner W. Hartenstein, Michael Herz, Frank Gilbert
RTA
1998
Springer
15 years 1 months ago
The Decidability of Simultaneous Rigid E-Unification with One Variable
We show that simultaneous rigid E-unification, or SREU for short, is decidable and in fact EXPTIME-complete in the case of one variable. This result implies that the fragment of i...
Anatoli Degtyarev, Yuri Gurevich, Paliath Narendra...
APAL
2007
88views more  APAL 2007»
14 years 9 months ago
Randomness and the linear degrees of computability
We show that there exists a real α such that, for all reals β, if α is linear reducible to β (α ≤ β, previously denoted α ≤sw β) then β ≤T α. In fact, every random ...
Andrew E. M. Lewis, George Barmpalias
CLASSIFICATION
2008
84views more  CLASSIFICATION 2008»
14 years 9 months ago
Degenerating Families of Dendrograms
Dendrograms used in data analysis are ultrametric spaces, hence objects of nonarchimedean geometry. It is known that there exist p-adic representations of dendrograms. Completed b...
Patrick Erik Bradley
CORR
2008
Springer
106views Education» more  CORR 2008»
14 years 9 months ago
Topological Observations on Multiplicative Additive Linear Logic
As an attempt to uncover the topological nature of composition of strategies in game semantics, we present a "topological" game for Multiplicative Additive Linear Logic ...
André Hirschowitz, Michel Hirschowitz, Tom ...