Sciweavers

1569 search results - page 166 / 314
» Programming contest strategy
Sort
View
100
Voted
ICALP
2010
Springer
15 years 26 days ago
What Is a Pure Functional?
Abstract. Given an ML function f : (int->int)->int how can we rigorously specify that f is pure, i.e., produces no side-effects other than those arising from calling its func...
Martin Hofmann, Aleksandr Karbyshev, Helmut Seidl
AICOM
2010
127views more  AICOM 2010»
15 years 25 days ago
Interactive verification of concurrent systems using symbolic execution
This paper presents an interactive proof method for the verification of temporal properties of concurrent systems based on symbolic execution. Symbolic execution is a well known a...
Simon Bäumler, Michael Balser, Florian Nafz, ...
94
Voted
ENTCS
2006
114views more  ENTCS 2006»
15 years 21 days ago
Prototyping SOS Meta-theory in Maude
We present a prototype implementation of SOS meta-theory in the Maude term rewriting language. The prototype defines the basic concepts of SOS meta-theory (e.g., transition formul...
Mohammad Reza Mousavi, Michel A. Reniers
117
Voted
LISP
2008
104views more  LISP 2008»
15 years 20 days ago
On the implementation of automatic differentiation tools
Automatic differentiation is a semantic transformation that applies the rules of differential calculus to source code. It thus transforms a computer program that computes a mathema...
Christian H. Bischof, Paul D. Hovland, Boyana Norr...
99
Voted

Publication
433views
15 years 9 months ago
Optimal Feature Selection for Subspace Image Matching
Image matching has been a central research topic in computer vision over the last decades. Typical approaches for correspondence involve matching features between images. In this p...
Gemma Roig, Xavier Boix, Fernando De la Torre