Sciweavers

279 search results - page 9 / 56
» Typability in Partial Applicative Structures
Sort
View
IJCV
2010
131views more  IJCV 2010»
13 years 6 months ago
Using the Particle Filter Approach to Building Partial Correspondences Between Shapes
Abstract Constructing correspondencesbetween points characterizing one shape with those characterizing another is crucial to understanding what the two shapes have in common. These...
Rolf Lakämper, Marc Sobel
DEBS
2007
ACM
13 years 9 months ago
Chained forests for fast subsumption matching
Content delivery is becoming increasingly popular on the Internet. There are many ways to match content to subscribers. In this paper, we focus on subsumption-based matching. We p...
Sasu Tarkoma
ATVA
2006
Springer
130views Hardware» more  ATVA 2006»
13 years 11 months ago
The Implementation of Mazurkiewicz Traces in POEM
We present the implementation of the trace theory in a new model checking tool framework, POEM, that has a strong emphasis on Partial Order Methods. A tree structure is used to sto...
Peter Niebert, Hongyang Qu
PEPM
1993
ACM
13 years 11 months ago
Polyvariant Binding-Time Analysis For Applicative Languages
Binding-time analysis is a crucial component of an ofine partial evaluator. The accuracy of the binding-time information that it produces determines the degree of specialization o...
Charles Consel
JLP
2006
98views more  JLP 2006»
13 years 7 months ago
Partiality I: Embedding relation algebras
As long as no cooperation between processes is supposed to take place, one may consider them separately and need not ask for the progress of the respective other processes. If a c...
Gunther Schmidt