Sciweavers

315 search results - page 63 / 63
» Algebraic Lower Bounds for Computing on Encrypted Data
Sort
View
MOBICOM
2003
ACM
13 years 10 months ago
Topology control for wireless sensor networks
We consider a two-tiered Wireless Sensor Network (WSN) consisting of sensor clusters deployed around strategic locations and base-stations (BSs) whose locations are relatively fl...
Jianping Pan, Yiwei Thomas Hou, Lin Cai, Yi Shi, S...
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
13 years 9 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts
EDBT
2009
ACM
156views Database» more  EDBT 2009»
13 years 8 months ago
Efficient skyline retrieval with arbitrary similarity measures
A skyline query returns a set of objects that are not dominated by other objects. An object is said to dominate another if it is closer to the query than the latter on all factors...
Deepak P, Prasad M. Deshpande, Debapriyo Majumdar,...
SIAMDM
2002
94views more  SIAMDM 2002»
13 years 4 months ago
How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems
A quorum system is a collection of sets (quorums) every two of which intersect. Quorum systems have been used for many applications in the area of distributed systems, including mu...
David Peleg, Avishai Wool
SIAMMAX
2010
164views more  SIAMMAX 2010»
12 years 11 months ago
Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
Amit Singer, Mihai Cucuringu