Sciweavers

4087 search results - page 128 / 818
» Sets in Types, Types in Sets
Sort
View
ICALP
2000
Springer
14 years 19 days ago
Average Bit-Complexity of Euclidean Algorithms
Abstract. We obtain new results regarding the precise average bitcomplexity of five algorithms of a broad Euclidean type. We develop a general framework for analysis of algorithms,...
Ali Akhavi, Brigitte Vallée
CCCG
2010
13 years 10 months ago
Direction assignment in wireless networks
In this paper we consider a wireless network, where each transceiver is equipped with a directional antenna, and study two direction assignment problems, determined by the type of...
Boaz Ben-Moshe, Paz Carmi, Lilach Chaitman, Matthe...
ACL
2006
13 years 10 months ago
Partially Specified Signatures: A Vehicle for Grammar Modularity
This work provides the essential foundations for modular construction of (typed) unification grammars for natural languages. Much of the information in such grammars is encoded in...
Yael Cohen-Sygal, Shuly Wintner
ENTCS
2006
130views more  ENTCS 2006»
13 years 9 months ago
Modularity in Coalgebra
This paper gives an overview of recent results concerning the modular derivation of (i) modal specification logics, (ii) notions of simulation together with logical characterisati...
Corina Cîrstea
JAPLL
2006
87views more  JAPLL 2006»
13 years 9 months ago
Is ZF a hack?: Comparing the complexity of some (formalist interpretations of) foundational systems for mathematics
This paper presents Automath encodings (which also are valid in LF/P) of various kinds of foundations of mathematics. Then it compares these encodings according to their size, to f...
Freek Wiedijk