1696 search results - page 42 / 340 » Permuted function matching |
TLCA
2001
Springer
15 years 2 months ago
2001
Springer
We introduce λµ→∧∨⊥ , an extension of Parigot’s λµ-calculus where disjunction is taken as a primitive. The associated reduction relation, which includes the permutati...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We present a new example of a partial boolean function whose one-way quantum communication complexity is exponentially lower than its one-way classical communication complexity. T...
ER
2007
Springer
15 years 4 months ago
2007
Springer
Approximate data matching applications typically use similarity functions to quantify the degree of likeness between two data instances. There are several similarity functions ava...
SEMWEB
2009
Springer
15 years 4 months ago
2009
Springer
As part of the European PROLIX (Process Oriented Learning and Information eXchange) project, VUB STARLab designed a generic ontologybased data matching framework (ODMF). Within the...
FPGA
1998
ACM
15 years 2 months ago
1998
ACM
In this paper, we developed Boolean matching techniques for complex programmable logic blocks (PLBs) in LUT-based FPGAs. A complex PLB can not only be used as a K-input LUT, but a...