1466 search results - page 45 / 294 » Complexity of Reasoning over Temporal Data Models |
123
Voted
PODS
2007
ACM
16 years 4 months ago
2007
ACM
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
132
click to vote
SDM
2010
SIAM
15 years 5 months ago
2010
SIAM
Real-world relational data are seldom stationary, yet traditional collaborative filtering algorithms generally rely on this assumption. Motivated by our sales prediction problem, ...
151
Voted
KR
2010
Springer
15 years 8 months ago
2010
Springer
Ontologies can be used to provide an enriched vocabulary for the formulation of queries over instance data. We identify query emptiness and predicate emptiness as two central reas...
128
click to vote
CGF
1999
15 years 3 months ago
1999
We describe an approach for interactive collision detection and proximity computations on massive models composed of millions of geometric primitives. We address issues related to...
115
click to vote
DLOG
2008
15 years 6 months ago
2008
Abstract. From the side of modelers and early-adopter industry, interest in reasoning over conceptual models and other online usage of conceptual models is growing. To obtain a mor...