Sciweavers

1161 search results - page 70 / 233
» Approximation schemes for clustering problems
Sort
View
ASIACRYPT
2009
Springer
15 years 4 months ago
Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
We demonstrate how the framework that is used for creating efficient number-theoretic ID and signature schemes can be transferred into the setting of lattices. This results in cons...
Vadim Lyubashevsky
ICPP
2009
IEEE
15 years 4 months ago
On Maximum Stability with Enhanced Scalability in High-Churn DHT Deployment
Abstract—When applied in a commercial deployment, DHTbased P2P protocols face a dilemma: although most real-world participants are so unstable that the maintenance overhead is pr...
Junfeng Xie, Zhenhua Li, Guihai Chen, Jie Wu
STOC
2007
ACM
146views Algorithms» more  STOC 2007»
15 years 10 months ago
Playing games with approximation algorithms
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
Sham M. Kakade, Adam Tauman Kalai, Katrina Ligett
ICC
2007
IEEE
203views Communications» more  ICC 2007»
15 years 4 months ago
Distributed Data Aggregation Using Clustered Slepian-Wolf Coding in Wireless Sensor Networks
—Slepian-Wolf coding is a promising distributed source coding technique that can completely remove the data redundancy caused by the spatially correlated observations in wireless...
Pu Wang, Cheng Li, Jun Zheng
EWSN
2004
Springer
15 years 9 months ago
Design of Surveillance Sensor Grids with a Lifetime Constraint
A surveillance area is to be monitored using a grid network of heterogeneous sensor nodes. There are two types of nodes; type 0 nodes which perform sensing and relaying of data wit...
Vivek Mhatre, Catherine Rosenberg, Daniel Kofman, ...