Sciweavers

5608 search results - page 180 / 1122
» On the Theory of Matchgate Computations
Sort
View
113
Voted
EUROCAST
2005
Springer
92views Hardware» more  EUROCAST 2005»
15 years 7 months ago
Computation of Partial Automata Through Span Composition
In this paper a way to have structures with partiality in its internal structure in a categorical approach is presented and, with this, a category of partial graphs Grp is given an...
Karina Roggia, Marnes Hoff, Paulo Blauth Menezes
DIGRA
2005
Springer
15 years 7 months ago
End of story? Quest, narrative and enactment in computer games
Espen Aarseth recently claimed that all games referred to as ’narrative games’ could better be described as ’quest games’. The writer of this paper suggests that Max Payne...
Anders Sundnes Løvlie
FOSSACS
2005
Springer
15 years 7 months ago
Mathematical Models of Computational and Combinatorial Structures
The general aim of this talk is to advocate a combinatorial perspective, together with its methods, in the investigation and study of models of computation structures. This, of cou...
Marcelo P. Fiore
ISAAC
2009
Springer
93views Algorithms» more  ISAAC 2009»
15 years 8 months ago
Computing Multidimensional Persistence
Abstract. The theory of multidimensional persistence captures the topology of a multifiltration – a multiparameter family of increasing spaces. Multifiltrations arise naturally...
Gunnar Carlsson, Gurjeet Singh, Afra Zomorodian
100
Voted
LICS
2008
IEEE
15 years 8 months ago
On the Computational Complexity of Cut-Reduction
Using appropriate notation systems for proofs, cutreduction can often be rendered feasible on these notations. Explicit bounds can be given. Developing a suitable notation system ...
Klaus Aehlig, Arnold Beckmann