210 search results - page 19 / 42 » On the Structure of Bounded Queries to Arbitrary NP Sets |
IJCGA
2007
14 years 9 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...
112
click to vote
ICALP
1994
Springer
15 years 1 months 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...
75
Voted
KDD
2010
ACM
15 years 1 months 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
15 years 2 months 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...
83
Voted
PODS
2003
ACM
15 years 9 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...