Sciweavers

2095 search results - page 127 / 419
» Improved pebbling bounds
Sort
View
INFOCOM
2011
IEEE
14 years 9 months ago
Optimal multiple-coverage of sensor networks
—In wireless sensor networks, multiple-coverage, in which each point is covered by more than one sensor, is often required to improve detection quality and achieve high fault tol...
Xiaole Bai, Ziqiu Yun, Dong Xuan, Biao Chen, Wei Z...
PODC
2011
ACM
14 years 9 months ago
MIS on trees
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
Christoph Lenzen, Roger Wattenhofer
ICCV
2011
IEEE
14 years 6 months ago
Trajectory reconstruction from non-overlapping surveillance cameras with relative depth ordering constraints
We present a method for reconstructing a trajectory of an object moving in front of non-overlapping fully or partially calibrated cameras. The non-overlapping setup turns that pro...
Branislav Micusik
ALT
2011
Springer
14 years 6 months ago
On Noise-Tolerant Learning of Sparse Parities and Related Problems
We consider the problem of learning sparse parities in the presence of noise. For learning parities on r out of n variables, we give an algorithm that runs in time poly log 1 δ , ...
Elena Grigorescu, Lev Reyzin, Santosh Vempala
CRYPTO
2011
Springer
232views Cryptology» more  CRYPTO 2011»
14 years 6 months ago
Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
Structure-preserving signatures are signatures defined over bilinear groups that rely on generic group operations. In particular, the messages and signatures consist of group elem...
Masayuki Abe, Jens Groth, Kristiyan Haralambiev, M...