1679 search results - page 194 / 336 » Strong order equivalence |
CSL
2007
Springer
14 years 26 days ago
2007
Springer
Abstract. A longstanding open problem is whether there exists a nonsyntactical model of the untyped -calculus whose theory is exactly the least -theory . In this paper we investiga...
IPAS
2007
13 years 11 months ago
2007
Conventional approach in single-chip digital cameras is a use of color lter arrays (CFA) in order to sample di erent spectral components. Demosaicing algorithms interpolate these ...
DAGSTUHL
2010
13 years 10 months ago
2010
Computer support for intervention planning is a two-stage process: In a first stage, the relevant segmentation target structures are identified and delineated. In a second stage, ...
WSC
1998
13 years 10 months ago
1998
We consider how to efficiently allocate computing resources in order to infer the best of a finite set of simulated systems, where best means that the system has the maximal expec...
DM
2008
13 years 9 months ago
2008
A simple graph G is k-ordered (respectively, k-ordered hamiltonian) if, for any sequence of k distinct vertices v1, . . . , vk of G, there exists a cycle (respectively, a hamilton...