793 search results - page 72 / 159 » Argumentation and standards of proof |
139
click to vote
STACS
2004
Springer
15 years 11 months ago
2004
Springer
We consider the problem of preemptive scheduling on uniformly related machines. We present a semi-online algorithm which, if the optimal makespan is given in advance, produces an ...
155
click to vote
FCT
2007
Springer
15 years 10 months ago
2007
Springer
The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, a...
142
click to vote
JSYML
2007
15 years 6 months ago
2007
The paper uses the formalism of indexed categories to recover the proof of a standard final coalgebra theorem, thus showing existence of final coalgebras for a special class of ...
146
click to vote
CVPR
1997
IEEE
16 years 8 months ago
1997
IEEE
We present a method for computing dense visual correspondence based on general assumptions about scene geometry. Our algorithm does not rely on correlation, and uses a variable re...
180
click to vote
HASKELL
2006
ACM
16 years 4 days ago
2006
ACM
Haskell’s type system with multi-parameter constructor classes and functional dependencies allows static (compile-time) computations to be expressed by logic programming on the ...