Sciweavers

3341 search results - page 262 / 669
» On Bounded Queries and Approximation
Sort
View
DEXAW
2010
IEEE
150views Database» more  DEXAW 2010»
15 years 7 months ago
Search Strategies for Keyword-based Queries
Given a set of keywords, we find a maximum Web query (containing the most keywords possible) that respects userdefined bounds on the number of returned hits. We assume a real-world...
Matthias Hagen, Benno Stein
DBPL
2009
Springer
131views Database» more  DBPL 2009»
16 years 1 months ago
XML Security Views Revisited
In this paper, we revisit the view based security framework for XML without imposing any of the previously considered restrictions on the class of queries, the class of DTDs, and t...
Benoît Groz, Slawomir Staworko, Anne-C&eacut...
ACSC
2009
IEEE
16 years 1 months ago
Microdata Protection Through Approximate Microaggregation
Microdata protection is a hot topic in the field of Statistical Disclosure Control, which has gained special interest after the disclosure of 658000 queries by the America Online...
Xiaoxun Sun, Hua Wang, Jiuyong Li
STACS
2001
Springer
15 years 11 months ago
Approximation Algorithms for the Bottleneck Stretch Factor Problem
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
Giri Narasimhan, Michiel H. M. Smid
CORR
2010
Springer
108views Education» more  CORR 2010»
15 years 6 months ago
Inverting a permutation is as hard as unordered search
We describe a reduction from the problem of unordered search (with a unique solution) to the problem of inverting a permutation. Since there is a straightforward reduction in the ...
Ashwin Nayak