210 search results - page 19 / 42 » On the Structure of Bounded Queries to Arbitrary NP Sets |
IJCGA
2007
13 years 8 months ago
2007
Given two sets A and B of m non-intersecting line segments in the plane, we show how to compute in O(m log m) time a data structure that uses O(m) space and allows to answer the fo...
ICALP
1994
Springer
14 years 21 days ago
1994
Springer
A hash table is a representation of a set in a linear size data structure that supports constanttime membership queries. We show how to construct a hash table for any given set of...
KDD
2010
ACM
14 years 15 days ago
2010
ACM
Compressing social networks can substantially facilitate mining and advanced analysis of large social networks. Preferably, social networks should be compressed in a way that they...
DOLAP
2000
ACM
14 years 29 days ago
2000
ACM
Being able to efficiently answer arbitrary OLAP queries that aggregate along any combination of dimensions over numerical and categorical attributes has been a continued, major co...
PODS
2003
ACM
14 years 8 months ago
2003
ACM
Watermarking allows robust and unobtrusive insertion of information in a digital document. Very recently, techniques have been proposed for watermarking relational databases or XM...