Sciweavers

1756 search results - page 87 / 352
» Mining Query Logs
Sort
View
FOCS
1993
IEEE
14 years 2 months ago
On Bounded Queries and Approximation
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
Richard Chang, William I. Gasarch
DAWAK
2004
Springer
14 years 3 months ago
Inductive Databases as Ranking
Abstract. Most of the research in data mining has been focused on developing novel algorithms for specific data mining tasks. However, finding the theoretical foundations of data...
Taneli Mielikäinen
IJCGA
2007
55views more  IJCGA 2007»
13 years 10 months ago
Parabola Separation Queries and their Application to Stone Throwing
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...
Otfried Cheong, Hazel Everett, Hyo-Sil Kim, Sylvai...
CORR
2012
Springer
227views Education» more  CORR 2012»
12 years 5 months ago
Trajectory and Policy Aware Sender Anonymity in Location Based Services
We consider Location-based Service (LBS) settings, where a LBS provider logs the requests sent by mobile device users over a period of time and later wants to publish/share these ...
Alin Deutsch, Richard Hull, Avinash Vyas, Kevin Ke...
STOC
2002
ACM
144views Algorithms» more  STOC 2002»
14 years 10 months ago
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...
Surender Baswana, Ramesh Hariharan, Sandeep Sen