1679 search results - page 194 / 336 » Strong order equivalence |
135
click to vote
CSL
2007
Springer
15 years 10 months 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...
180
click to vote
IPAS
2007
15 years 8 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 ...
147
click to vote
DAGSTUHL
2010
15 years 7 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, ...
131
click to vote
WSC
1998
15 years 7 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...
144
click to vote
DM
2008
15 years 6 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...