5350 search results - page 107 / 1070 » Space and time in eco-ontologies |
188
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been ...
191
click to vote
ISAAC
2010
Springer
15 years 4 months ago
2010
Springer
In this paper, we study 1-space bounded 2-dimensional bin packing and square packing. A sequence of rectangular items (square items, respectively) arrive over time, which must be p...
167
click to vote
ACL
1994
15 years 7 months ago
1994
This paper shows how to formally characterize language learning in a finite parameter space as a Markov structure, hnportant new language learning results follow directly: explici...
164
click to vote
APVIS
2008
15 years 7 months ago
2008
We present a technique for memory-efficient and time-efficient volume rendering of curvilinear adaptive mesh refinement data defined within extrudable computational spaces. One of...
147
click to vote
IFL
2001
Springer
15 years 11 months ago
2001
Springer
A programming language with subtyping can be translated into a language without subtyping by inserting conversion functions. Previous studies of this interpretation showed only the...