Sciweavers

395 search results - page 69 / 79
» Positive Versions of Polynomial Time
Sort
View
GIS
2007
ACM
15 years 11 months ago
Location anonymity in continuous location-based services
A major concern for large-scale deployment of location-based services (LBSs) is the potential abuse of their client location data, which may imply sensitive personal information. ...
Toby Xu, Ying Cai
APPROX
2007
Springer
104views Algorithms» more  APPROX 2007»
15 years 4 months ago
Worst-Case to Average-Case Reductions Revisited
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
Dan Gutfreund, Amnon Ta-Shma
MOR
2008
169views more  MOR 2008»
14 years 9 months ago
The Flow Set with Partial Order
The flow set with partial order is a mixed-integer set described by a budget on total flow and a partial order on the arcs that may carry positive flow. This set is a common substr...
Alper Atamtürk, Muhong Zhang
CORR
2012
Springer
225views Education» more  CORR 2012»
13 years 5 months ago
The Filter-Placement Problem and its Application to Minimizing Information Multiplicity
In many information networks, data items – such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route u...
Dóra Erdös, Vatche Ishakian, Andrei La...
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
15 years 10 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson