Sciweavers

5269 search results - page 83 / 1054
» order 2007
Sort
View
120
Voted
APAL
2004
73views more  APAL 2004»
15 years 3 months ago
Shrinking games and local formulas
Gaifman's normal form theorem showed that every first order sentence of quantifier rank n is equivalent to a Boolean combination of "scattered local sentences", whe...
H. Jerome Keisler, Wafik Boulos Lotfallah
105
Voted
MVA
1992
173views Computer Vision» more  MVA 1992»
15 years 4 months ago
VLSI Optimal Edge Detection Chip: Canny-Deriche Filter
This paper presents the design of an ASIC intended for optimal edge detection of blurred and noisy 2-D images. The chip has a parallel and pipelined architecture which processes a...
Mohamed Akil, Nizar Zarka
APAL
2006
113views more  APAL 2006»
15 years 3 months ago
Coding by club-sequences
Given any subset A of 1 there is a proper partial order which forces that the predicate x A and the predicate x 1\A can be expressed by ZFC
David Asperó
156
Voted
EJC
2008
15 years 3 months ago
Labeled posets are universal
Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. The homomorphicity order of k-posets is shown to be a distributive lattice. Homomorph...
Erkko Lehtonen
134
Voted
CSL
2007
Springer
15 years 10 months ago
Unbounded Proof-Length Speed-Up in Deduction Modulo
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
Guillaume Burel