Sciweavers

4757 search results - page 103 / 952
» Monads for Functional Programming
Sort
View
129
Voted
ECCV
2000
Springer
16 years 4 months ago
Diffeomorphic Matching Problems in One Dimension: Designing and Minimizing Matching Functionals
This paper focuses on matching 1D structures by variational methods. We provide rigorous rules for the construction of the cost function, on the basis of an analysis of properties ...
Alain Trouvé, Laurent Younes
JCT
2000
103views more  JCT 2000»
15 years 2 months ago
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm does not use the ellipsoid method or any other linear ...
Alexander Schrijver
HASKELL
2005
ACM
15 years 8 months ago
TypeCase: a design pattern for type-indexed functions
A type-indexed function is a function that is defined for each member of some family of types. Haskell’s type class mechanism provides collections of open type-indexed function...
Bruno C. D. S. Oliveira, Jeremy Gibbons
101
Voted
HICSS
1999
IEEE
72views Biometrics» more  HICSS 1999»
15 years 6 months ago
Software Reliability as a Function of User Execution Patterns
Assessing the reliability of a software system has always been an elusive target. A program may work very well for a number of years and this same program may suddenly become quit...
John C. Munson, Sebastian G. Elbaum
CONCUR
2009
Springer
15 years 6 months ago
Time-Bounded Verification
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
Joël Ouaknine, Alexander Rabinovich, James Wo...