Sciweavers

68 search results - page 6 / 14
» Extension of First-Order Theories into Trees
Sort
View
LICS
2010
IEEE
13 years 5 months ago
Regular Cost Functions over Finite Trees
We develop the theory of regular cost functions over finite trees: a quantitative extension to the notion of regular languages of trees: Cost functions map each input (tree) to a v...
Thomas Colcombet, Christof Löding
FOIKS
2008
Springer
13 years 9 months ago
SIM-PDT: A Similarity Based Possibilistic Decision Tree Approach
This paper investigates an extension of classification trees to deal with uncertain information where uncertainty is encoded in possibility theory framework. Class labels in data s...
Ilyes Jenhani, Nahla Ben Amor, Salem Benferhat, Zi...
WSCG
2001
77views more  WSCG 2001»
13 years 8 months ago
Physics-Enhanced L-Systems
In computer graphics and engineering many classes of complex objects can be designed with L-systems. We present a concept for enhancing timed and parametric L-systems with physics...
Hansrudi Noser, S. Rudolph, Peter Stucki
FCT
2003
Springer
14 years 21 days ago
Graph Searching, Elimination Trees, and a Generalization of Bandwidth
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
JSYML
2008
72views more  JSYML 2008»
13 years 7 months ago
Perfect trees and elementary embeddings
An important technique in large cardinal set theory is that of extending an elementary embedding j : M N between inner models to an elementary embedding j : M[G] N[G] between ge...
Sy-David Friedman, Katherine Thompson