614 search results - page 4 / 123 » DE in Slovenia: Where are We |
VLDB
2001
ACM
14 years 19 hour ago
2001
ACM
We are interested in de ning and querying views in a huge and highly heterogeneous XML repository Web scale . In this context, view de nitions are very large and there is no appa...
COCOON
2005
Springer
14 years 1 months ago
2005
Springer
The terminal Steiner tree problem (TST) consists of finding a minimum cost Steiner tree where each terminal is a leaf. We describe a factor 2ρ−ρ/(3ρ−2) approximation algor...
AIPS
2011
12 years 11 months ago
2011
Engineering complete planning domain descriptions is often very costly because of human error or lack of domain knowledge. Learning complete domain descriptions is also very chall...
DLT
2008
13 years 9 months ago
2008
Abstract. In a recent paper with L. Q. Zamboni the authors introduced the class of -episturmian words, where is an involutory antimorphism of the free monoid A . In this paper, we...
IJCAI
1989
13 years 8 months ago
1989
Fold-unfold is a well known program transformation technique. Its major drawback is that folding requires an Eureka step to invent new procedures. In the context of logic programm...