Sciweavers

5793 search results - page 410 / 1159
» Individual communication complexity
Sort
View
CDC
2010
IEEE
107views Control Systems» more  CDC 2010»
15 years 1 months ago
Deployment of an unreliable robotic sensor network for spatial estimation
This paper studies an optimal deployment problem for a network of robotic sensors moving in the real line. Given a spatial process of interest, each individual sensor sends a pack...
Jorge Cortes
ACSC
2008
IEEE
16 years 1 months ago
Privacy preserving set intersection based on bilinear groups
We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication c...
Yingpeng Sang, Hong Shen
ICIP
2006
IEEE
16 years 8 months ago
Supershape Recovery from 3D Data Sets
In this paper, we apply supershapes and R-functions to surface recovery from 3D data sets. Individual supershapes are separately recovered from a segmented mesh. R-functions are u...
Andrei V. Gribok, Frédéric Truchetet...
CHI
2004
ACM
16 years 7 months ago
Passwords you'll never forget, but can't recall
We identify a wide range of human memory phenomena as potential certificates of identity. These "imprinting" behaviors are characterized by vast capacity for complex exp...
Daphna Weinshall, Scott Kirkpatrick
SIGMOD
2006
ACM
170views Database» more  SIGMOD 2006»
16 years 7 months ago
Energy-efficient monitoring of extreme values in sensor networks
Monitoring extreme values (MAX or MIN) is a fundamental problem in wireless sensor networks (and in general, complex dynamic systems). This problem presents very different algorit...
Adam Silberstein, Jun Yang 0001, Kamesh Munagala