Sciweavers

8512 search results - page 241 / 1703
» Computing Theory With Relevance
Sort
View
122
Voted
ISAAC
2009
Springer
93views Algorithms» more  ISAAC 2009»
15 years 11 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
134
Voted
LICS
2008
IEEE
15 years 11 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
STOC
1996
ACM
197views Algorithms» more  STOC 1996»
15 years 9 months ago
Computing Betti Numbers via Combinatorial Laplacians
We use the Laplacian and power method to compute Betti numbers of simplicial complexes. This has a number of advantages over other methods, both in theory and in practice. It requ...
Joel Friedman
122
Voted
COLING
1996
15 years 6 months ago
Computing Prosodic Morphology
This paper establishes a framework under which various aspects of prosodic morphology, such as templatic morphology and infixation, can be handled under two-level theory using an ...
George Anton Kiraz
CORR
2008
Springer
93views Education» more  CORR 2008»
15 years 5 months ago
A computer verified, monadic, functional implementation of the integral
We provide a computer verified exact monadic functional implementation of the Riemann integral in type theory. Together with previous work by O'Connor, this may be seen as the...
Russell O'Connor, Bas Spitters