1717 search results - page 143 / 344 » A Computable Spectral Theorem |
115
click to vote
LACL
1998
Springer
15 years 8 months ago
1998
Springer
In this paper, we consider some of the problems that arise if automated reasoning methods are applied to natural language semantics. It turns that out that the problem of ambiguity...
122
Voted
CSR
2006
Springer
15 years 8 months ago
2006
Springer
The logic of proofs is known to be complete for the semantics of proofs in PA. In this paper we present a refinement of this theorem, we will show that we can assure that all the ...
130
click to vote
GC
2007
Springer
15 years 4 months ago
2007
Springer
Let H be a multigraph and G a graph containing a subgraph isomorphic to a subdivision of H, with S ⊂ V (G) (the ground set) the image of V (H) under the isomorphism. We consider...
113
click to vote
PPSN
2010
Springer
15 years 3 months ago
2010
Springer
An important step in gaining a better understanding of the stochastic dynamics of evolving populations, is the development of appropriate analytical tools. We present a new drift t...
168
Voted
DCG
2011
14 years 11 months ago
2011
We show that any point in the convex hull of each of (d +1) sets of (d +1) points in general position in Rd is contained in at least (d + 1)2/2 simplices with one vertex from each ...