Sciweavers

32 search results - page 3 / 7
» Bounding Performance Loss in Approximate MDP Homomorphisms
Sort
View
EDBT
2010
ACM
110views Database» more  EDBT 2010»
14 years 10 days ago
The hardness and approximation algorithms for l-diversity
The existing solutions to privacy preserving publication can be classified into the theoretical and heuristic categories. The former guarantees provably low information loss, whe...
Xiaokui Xiao, Ke Yi, Yufei Tao
VTC
2006
IEEE
118views Communications» more  VTC 2006»
13 years 11 months ago
Demodulation and Performance Analysis of Differential Unitary Space-Time Modulation in Time-Varying Rician Channels
Abstract— Studies on differential unitary space-time modulation are mostly focused on Rayleigh fading channels. In this paper we present new analytic results for the maximum-like...
Haichang Sui, James R. Zeidler
COLT
2007
Springer
13 years 11 months ago
Resource-Bounded Information Gathering for Correlation Clustering
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...
Pallika Kanani, Andrew McCallum
EWSN
2011
Springer
12 years 9 months ago
An Adaptive Algorithm for Compressive Approximation of Trajectory (AACAT) for Delay Tolerant Networks
Highly efficient compression provides a promising approach to address the transmission and computation challenges imposed by moving object tracking applications on resource constra...
Rajib Kumar Rana, Wen Hu, Tim Wark, Chun Tung Chou
ICCAD
2006
IEEE
129views Hardware» more  ICCAD 2006»
14 years 2 months ago
Energy budgeting for battery-powered sensors with a known task schedule
Battery-powered wireless sensors are severely constrained by the amount of the available energy. A method for computing the energy budget per sensing task can be a valuable design...
Daler N. Rakhmatov