Sciweavers

1172 search results - page 226 / 235
» Constructions of generalized Sidon sets
Sort
View
CTCS
1989
Springer
15 years 3 months ago
Quantitative Domains, Groupoids and Linear Logic
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
Paul Taylor 0002
APWEB
2009
Springer
15 years 3 months ago
Ontology Evaluation through Text Classification
We present a new method to evaluate a search ontology, which relies on mapping ontology instances to textual documents. On the basis of this mapping, we evaluate the adequacy of on...
Yael Dahan Netzer, David Gabay, Meni Adler, Yoav G...
BTW
2007
Springer
236views Database» more  BTW 2007»
15 years 3 months ago
A Classification of Schema Mappings and Analysis of Mapping Tools
: Schema mapping techniques for data exchange have become popular and useful tools both in research and industry. A schema mapping relates a source schema with a target schema via ...
Frank Legler, Felix Naumann
GLVLSI
2009
IEEE
126views VLSI» more  GLVLSI 2009»
15 years 3 months ago
An efficient cut enumeration for depth-optimum technology mapping for LUT-based FPGAs
Recent technology mappers for LUT based FPGAs employ cut enumeration. Although many cuts are often needed to nd good network, enumerating all cuts with large size consumes run-tim...
Taiga Takata, Yusuke Matsunaga
COCO
2004
Springer
185views Algorithms» more  COCO 2004»
15 years 3 months ago
Limitations of Quantum Advice and One-Way Communication
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Scott Aaronson