Sciweavers

25 search results - page 3 / 5
» Efficient Tradeoff Schemes in Data Structures for Querying M...
Sort
View
EDBT
2010
ACM
206views Database» more  EDBT 2010»
14 years 3 days ago
Efficient computation of trade-off skylines
When selecting alternatives from large amounts of data, trade-offs play a vital role in everyday decision making. In databases this is primarily reflected by the top-k retrieval p...
Christoph Lofi, Ulrich Güntzer, Wolf-Tilo Bal...
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
14 years 5 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup
GIS
2007
ACM
14 years 6 months ago
TS2-tree - an efficient similarity based organization for trajectory data
The increasingly popular GPS technology and the growing amount of trajectory data it generates create the need for developing applications that efficiently store and query traject...
Petko Bakalov, Eamonn J. Keogh, Vassilis J. Tsotra...
ALGORITHMICA
2004
132views more  ALGORITHMICA 2004»
13 years 5 months ago
A General Model for Authenticated Data Structures
Query answers from on-line databases can easily be corrupted by hackers or malicious database publishers. Thus it is important to provide mechanisms which allow clients to trust th...
Charles U. Martel, Glen Nuckolls, Premkumar T. Dev...
LREC
2008
151views Education» more  LREC 2008»
13 years 6 months ago
A LAF/GrAF based Encoding Scheme for underspecified Representations of syntactic Annotations
Data models and encoding formats for syntactically annotated text corpora need to deal with syntactic ambiguity; underspecified representations are particularly well suited for th...
Manuel Kountz, Ulrich Heid, Kerstin Eckart