Sciweavers

5954 search results - page 608 / 1191
» Querying Bi-level Information
Sort
View
STOC
2012
ACM
272views Algorithms» more  STOC 2012»
13 years 9 months ago
The cell probe complexity of dynamic range counting
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...
Kasper Green Larsen
ICDT
2012
ACM
251views Database» more  ICDT 2012»
13 years 9 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
BTW
2007
Springer
122views Database» more  BTW 2007»
16 years 1 months ago
YAWN: A Semantically Annotated Wikipedia XML Corpus
: The paper presents YAWN, a system to convert the well-known and widely used Wikipedia collection into an XML corpus with semantically rich, self-explaining tags. We introduce alg...
Ralf Schenkel, Fabian M. Suchanek, Gjergji Kasneci
SIGIR
2000
ACM
15 years 11 months ago
The Cambridge University multimedia document retrieval demo system
The Cambridge University Multimedia Document Retrieval Demo System is a web based application that allows the user to query a database of automatically generated transcripts of ra...
A. Tuerk, Sue E. Johnson, P. Jourlin, Karen Sparck...
DATESO
2007
85views Database» more  DATESO 2007»
15 years 8 months ago
Improvement of Text Compression Parameters Using Cluster Analysis
Abstract. Several actions are usually performed when document is appended to textual database in information retrieval system. The most frequent actions are compression of the docu...
Jiri Dvorský, Jan Martinovic