2414 search results - page 52 / 483 » Computing Normal Subgroups |
LICS
2005
IEEE
14 years 1 months ago
2005
IEEE
This paper describes two new bisimulation equivalences for the pure untyped call-by-value λ-calculus, called enf bisimilarity and enf bisimilarity up to η. They are based on eag...
PPDP
2004
Springer
14 years 1 months ago
2004
Springer
We investigate some fundamental properties of the reduction relation in the untyped term calculus derived from Curien and Herbelin’s λµµ. The original λµµ has a system of ...
EMMCVPR
2009
Springer
14 years 8 days ago
2009
Springer
Global region-based active contours, like the Chan-Vese model, often make strong assumptions on the intensity distributions of the searched object and background, preventing their ...
LFCS
1994
Springer
13 years 11 months ago
1994
Springer
In a previous paper [4], we introduced a non-deterministic -calculus (-LK) whose type system corresponds exactly to Gentzen's cut-free LK [9]. This calculus, however, cannot b...
JCP
2008
13 years 7 months ago
2008
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...