Sciweavers

198 search results - page 34 / 40
» Evidence-invariant Sensitivity Bounds
Sort
View
MOBIHOC
2005
ACM
14 years 7 months ago
Toward resilient security in wireless sensor networks
Node compromise poses severe security threats in wireless sensor networks. Unfortunately, existing security designs can address only a small, fixed threshold number of compromised...
Hao Yang, Fan Ye, Yuan Yuan, Songwu Lu, William A....
ICIP
2009
IEEE
14 years 6 months ago
Edge-preserving Colorization using Data-Driven Random Walks with Restart
In this paper, we consider the colorization problem of grayscale images in which some color scribbles are initially given. Our proposed method is based on the weighted color blendi...
Tae Hoon Kim (Seoul National University), Kyoung M...
SODA
2010
ACM
164views Algorithms» more  SODA 2010»
14 years 5 months ago
Differentially Private Approximation Algorithms
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
ICDE
2010
IEEE
177views Database» more  ICDE 2010»
14 years 2 months ago
Optimal load shedding with aggregates and mining queries
— To cope with bursty arrivals of high-volume data, a DSMS has to shed load while minimizing the degradation of Quality of Service (QoS). In this paper, we show that this problem...
Barzan Mozafari, Carlo Zaniolo
INFOCOM
2009
IEEE
14 years 2 months ago
Fighting Spam with the NeighborhoodWatch DHT
—In this paper, we present DHTBL, an anti-spam blacklist built upon a novel secure distributed hash table (DHT). We show how DHTBL can be used to replace existing DNS-based black...
Adam Bender, Rob Sherwood, Derek Monner, Nathan Go...