Sciweavers

4940 search results - page 77 / 988
» On the Complexity of Universal Programs
Sort
View
ENTCS
2008
110views more  ENTCS 2008»
15 years 6 months ago
On a Fully Abstract Model for a Quantum Linear Functional Language: (Extended Abstract)
ly abstract model for a quantum unctional language (extended abstract) Peter Selinger1 ,2 Dalhousie University, Halifax, Nova Scotia, Canada Beno^it Valiron3 University of Ottawa, ...
Peter Selinger, Benoît Valiron
VMCAI
2007
Springer
16 years 7 days ago
Better Under-Approximation of Programs by Hiding Variables
Abstraction frameworks use under-approximating transitions in order to prove existential properties of concrete systems. Under-approximating transifer to the concrete states that c...
Thomas Ball, Orna Kupferman
COMGEO
2008
ACM
15 years 6 months ago
Recursive geometry of the flow complex and topology of the flow complex filtration
The flow complex is a geometric structure, similar to the Delaunay tessellation, to organize a set of (weighted) points in Rk. Flow shapes are topological spaces corresponding to ...
Kevin Buchin, Tamal K. Dey, Joachim Giesen, Matthi...
ICALT
2006
IEEE
16 years 6 days ago
Implementation of a Personalized Assessment Web Service
This paper describes the design, development and qualitative evaluation of a web-based personalized assessment service of an object–oriented programming course at the University...
Lilia Cheniti-Belcadhi, Nicola Henze, Rafik Braham
IEEEICCI
2009
IEEE
16 years 24 days ago
Interval sets and interval-set algebras
An interval set is an interval in the power set lattice based on a universal set and is a family of subsets of the universal set. Interval sets and interval-set algebras provide a...
Yiyu Yao