2859 search results - page 316 / 572 » Querying Complex Structured Databases |
197
click to vote
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
Abstract-Unstructured text represents a large fraction of the world's data. It often contain snippets of structured information within them (e.g., people's names and zip ...
179
Voted
CCCG
2008
15 years 8 months ago
2008
Given a set of n points P = {p1, p2, . . . , pn} in the plane, we show how to preprocess P such that for any query line segment L we can report in O(log n) time the smallest enclo...
174
click to vote
ICDT
2010
ACM
15 years 10 months ago
2010
ACM
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
171
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
197
click to vote
CRYPTO
2008
Springer
15 years 8 months ago
2008
Springer
In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption sc...