Sciweavers

1507 search results - page 154 / 302
» Separating Complexity Classes Using Structural Properties
Sort
View
SSD
2007
Springer
146views Database» more  SSD 2007»
14 years 4 months ago
Blind Evaluation of Nearest Neighbor Queries Using Space Transformation to Preserve Location Privacy
In this paper we propose a fundamental approach to perform the class of Nearest Neighbor (NN) queries, the core class of queries used in many of the location-based services, withou...
Ali Khoshgozaran, Cyrus Shahabi
COCO
2010
Springer
152views Algorithms» more  COCO 2010»
14 years 2 months ago
A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
Derrick Stolee, Chris Bourke, N. V. Vinodchandran
CISS
2008
IEEE
14 years 4 months ago
Distributed computation of a sparse cover in sensor networks without location information
— In this paper, we present a distributed algorithm for detecting redundancies in a sensor network with no location information. We demonstrate how, in the absence of localizatio...
Alireza Tahbaz-Salehi, Ali Jadbabaie
CDC
2008
IEEE
166views Control Systems» more  CDC 2008»
14 years 5 days ago
Distributed coverage verification in sensor networks without location information
In this paper, we present a series of distributed algorithms for coverage verification in sensor networks with no location information. We demonstrate how, in the absence of locali...
Alireza Tahbaz-Salehi, Ali Jadbabaie
STOC
2012
ACM
256views Algorithms» more  STOC 2012»
12 years 19 days ago
Competitive contagion in networks
We develop a game-theoretic framework for the study of competition between firms who have budgets to “seed” the initial adoption of their products by consumers located in a s...
Sanjeev Goyal, Michael Kearns