340 search results - page 64 / 68 » A New Algorithm for the Construction of Optimal B-Trees |
DLOG
2001
13 years 9 months ago
2001
For description logics with existential restrictions, the size of the least common subsumer (lcs) of concept descriptions may grow exponentially in the size of the concept descrip...
POPL
2012
ACM
12 years 3 months ago
2012
ACM
Gradual typing lets programmers evolve their dynamically typed programs by gradually adding explicit type annotations, which confer benefits like improved performance and fewer r...
ALT
2007
Springer
14 years 1 months ago
2007
Springer
In transfer learning the aim is to solve new learning tasks using fewer examples by using information gained from solving related tasks. Existing transfer learning methods have be...
ICDE
2006
IEEE
14 years 9 months ago
2006
IEEE
The rapid increase in the data volumes for the past few decades has intensified the need for high processing power for database and data mining applications. Researchers have acti...
SIGMOD
1995
ACM
13 years 11 months ago
1995
ACM
We study the problem of e cient maintenance of materialized views that may contain duplicates. This problem is particularly important when queries against such views involve aggre...