Sciweavers

6829 search results - page 1004 / 1366
» Quantitative Generalizations of Languages
Sort
View
SAC
2009
ACM
15 years 11 months ago
Aspect-oriented procedural content engineering for game design
Generally progressive procedural content in the context of 3D scene rendering is expressed as recursive functions where a finer level of detail gets computed on demand. Typical e...
Walter Cazzola, Diego Colombo, Duncan Harrison
NLPRS
2001
Springer
15 years 11 months ago
A Bayesian Approach to Semi-Supervised Learning
Recent research in automated learning has focused on algorithms that learn from a combination of tagged and untagged data. Such algorithms can be referred to as semi-supervised in...
Rebecca F. Bruce
ICALP
1998
Springer
15 years 11 months ago
Static and Dynamic Low-Congested Interval Routing Schemes
Interval Routing Schemes (IRS for short) have been extensively investigated in the past years with special emphasis on shortest paths. Besides their theoretical interest, IRS have...
Serafino Cicerone, Gabriele Di Stefano, Michele Fl...
ICALP
1993
Springer
15 years 11 months ago
Exact Asymptotics of Divide-and-Conquer Recurrences
The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used i...
Philippe Flajolet, Mordecai J. Golin
LPNMR
1990
Springer
15 years 11 months ago
The meaning of Negative Premises in Transition System Specifications
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
Roland N. Bol, Jan Friso Groote
« Prev « First page 1004 / 1366 Last » Next »