1302 search results - page 28 / 261 » Free-Style Theorem Proving |
LCC
1994
13 years 11 months ago
1994
We firstly survey several forms of Herbrand's theorem. What is commonly called "Herbrand's theorem" in many textbooks is actually a very simple form of Herbrand...
TIT
2002
13 years 7 months ago
2002
Abstract--Zador's classic result for the asymptotic high-rate behavior of entropy-constrained vector quantization is recast in a Lagrangian form which better matches the Lloyd...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We study hierachical segmentation in the framework of edgeweighted graphs. We define ultrametric watersheds as topological watersheds null on the minima. We prove that th...
MEMOCODE
2006
IEEE
14 years 1 months ago
2006
IEEE
Timed I/O Automata (TIOA) is a mathematical framework for modeling and verification of distributed systems that involve discrete and continuous dynamics. TIOA can be used for exa...
CSL
2008
Springer
13 years 9 months ago
2008
Springer
We study the problem of proving in weak theories of Bounded Arithmetic the theorem that there are arbitrarily large prime numbers. We show that the theorem can be proved by some &...