Sciweavers

958 search results - page 103 / 192
» Efficient data structures for range-aggregate queries on tre...
Sort
View
IJFCS
2006
108views more  IJFCS 2006»
14 years 10 months ago
Reconstructing a Suffix Array
Abstract. For certain problems (for example, computing repetitions and repeats, data compression applications) it is not necessary that the suffixes of a string represented in a su...
Frantisek Franek, William F. Smyth
PODS
2003
ACM
135views Database» more  PODS 2003»
15 years 10 months ago
Query-preserving watermarking of relational databases and XML documents
Watermarking allows robust and unobtrusive insertion of information in a digital document. Very recently, techniques have been proposed for watermarking relational databases or XM...
David Gross-Amblard
BMCBI
2006
116views more  BMCBI 2006»
14 years 10 months ago
Whole genome association mapping by incompatibilities and local perfect phylogenies
Background: With current technology, vast amounts of data can be cheaply and efficiently produced in association studies, and to prevent data analysis to become the bottleneck of ...
Thomas Mailund, Søren Besenbacher, Mikkel H...
BTW
2007
Springer
292views Database» more  BTW 2007»
15 years 2 months ago
Effective and Efficient Indexing for Large Video Databases
Abstract: Content based multimedia retrieval is an important topic in database systems. An emerging and challenging topic in this area is the content based search in video data. A ...
Christian Böhm, Peter Kunath, Alexey Pryakhin...
VLDB
1994
ACM
134views Database» more  VLDB 1994»
15 years 2 months ago
V-Trees - A Storage Method for Long Vector Data
This paper introduces a new data structure, called V-trees, designed to store long sequences of points in 2D space and yet allow efficient access to their fragments. They also opt...
Maurício R. Mediano, Marco A. Casanova, Mar...