Sciweavers

412 search results - page 11 / 83
» Innovations in computational type theory using Nuprl
Sort
View
CIE
2007
Springer
14 years 3 months ago
Binary Trees and (Maximal) Order Types
Concerning the set of rooted binary trees, one shows that Higman’s Lemma and Dershowitz’s recursive path ordering can be used for the decision of its maximal order type accordi...
Gyesik Lee
ESOP
2004
Springer
14 years 2 months ago
A Dependently Typed Ambient Calculus
The Ambient calculus is a successful model of distributed, mobile computation, and has been the vehicle of new ideas for resource access control. Mobility types have been used to e...
Cédric Lhoussaine, Vladimiro Sassone
COGSR
2010
74views more  COGSR 2010»
13 years 4 months ago
Two qubits for C.G. Jung's theory of personality
We propose a formalization of C.G. Jung's theory of personality using a four-dimensional Hilbert-space for the representation of two qubits. The first qubit relates to Jung&#...
Reinhard Blutner, Elena Hochnadel
INFOCOM
2012
IEEE
11 years 11 months ago
A theory of cloud bandwidth pricing for video-on-demand providers
—Current-generation cloud computing is offered with usage-based pricing, with no bandwidth capacity guarantees, which is however unappealing to bandwidth-intensive applications s...
Di Niu, Chen Feng, Baochun Li
JACM
2000
119views more  JACM 2000»
13 years 8 months ago
A minimum spanning tree algorithm with Inverse-Ackermann type complexity
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
Bernard Chazelle