3891 search results - page 537 / 779 » Query Models |
257
click to vote
STOC
2012
ACM
13 years 5 months ago
2012
ACM
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
119
Voted
AAAI
2000
15 years 4 months ago
2000
Although much has been written about various information integration technologies, little has been said regarding how to combine these technologies together to build an entire &qu...
117
click to vote
STOC
2010
ACM
15 years 7 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
149
Voted
ECAI
2010
Springer
15 years 1 months ago
2010
Springer
Many document collections are by nature dynamic, evolving as the topics or events they describe change. The goal of temporal text mining is to discover bursty patterns and to ident...
141
click to vote
PODS
2008
ACM
16 years 3 months ago
2008
ACM
We consider the navigational core of XPath, extended with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operat...