513 search results - page 44 / 103 » Finitely Based, Finite Sets of Words |
ORL
2008
14 years 11 months ago
2008
We discuss the almost-sure convergence of a broad class of sampling algorithms for multi-stage stochastic linear programs. We provide a convergence proof based on the finiteness o...
TVCG
2012
13 years 2 months ago
2012
—In this paper, we present a novel isosurface visualization technique that guarantees the accurate visualization of isosurfaces with complex attribute data defined on (un)structu...
111
click to vote
CSL
2008
Springer
15 years 1 months ago
2008
Springer
Quantitative generalizations of classical languages, which assign to each word a real number instead of a boolean value, have applications in modeling resource-constrained computat...
104
click to vote
MLQ
2000
14 years 11 months ago
2000
In Zermelo-Fraenkel set theory with the axiom of choice every set has the same cardinal number as some ordinal. Von Rimscha has weakened this condition to "Every set has the s...
ICALP
2004
Springer
15 years 5 months ago
2004
Springer
We consider the multiplicative and exponential fragment of linear logic (MELL) and give a Geometry of Interaction (GoI) semantics for it based on unique decomposition categories. ...