943 search results - page 143 / 189 » How should data structures and algorithms be taught |
VLDB
2004
ACM
14 years 8 months ago
2004
ACM
Abstract. In dynamic environments like the Web, data sources may change not only their data but also their schemas, their semantics, and their query capabilities.When a mapping is ...
VLDB
2007
ACM
14 years 8 months ago
2007
ACM
In this article, we propose a new approach for querying and indexing a database of trees with specific applications to XML datasets. Our approach relies on representing both the q...
APPROX
2008
Springer
13 years 10 months ago
2008
Springer
It is known that if a 2-universal hash function H is applied to elements of a block source (X1, . . . , XT ), where each item Xi has enough min-entropy conditioned on the previous...
SDM
2010
SIAM
13 years 9 months ago
2010
SIAM
A relational probability tree (RPT) is a type of decision tree that can be used for probabilistic classification of instances with a relational structure. Each leaf of an RPT cont...
WWW
2005
ACM
14 years 8 months ago
2005
ACM
While the idea that querying mechanisms for complex relationships (otherwise known as Semantic Associations) should be integral to Semantic Web search technologies has recently ga...