Sciweavers

1511 search results - page 184 / 303
» Randomness, lowness and degrees
Sort
View
INFOCOM
2008
IEEE
16 years 23 days ago
On the Construction of a Maximum-Lifetime Data Gathering Tree in Sensor Networks: NP-Completeness and Approximation Algorithm
Abstract—Energy efficiency is critical for wireless sensor networks. The data gathering process must be carefully designed to conserve energy and extend the network lifetime. Fo...
Yan Wu, Sonia Fahmy, Ness B. Shroff
IPPS
2008
IEEE
16 years 23 days ago
An effective pointer replication algorithm in P2P networks
Peer-to-Peer (P2P) networks have proven to be an efficient and successful mechanism for file sharing over the Internet. However, current P2P protocols have long worst case query...
Jian Zhou, Laxmi N. Bhuyan, Anirban Banerjee
IROS
2008
IEEE
104views Robotics» more  IROS 2008»
16 years 23 days ago
Kinematic study of the spider system in a biomimetic perspective
— The spiders’ ability of walking and climbing on different surfaces and in different conditions is taken into account in this paper in order to define and study a suitable sp...
Alessandro Gasparetto, Renato Vidoni, Tobias Seidl
VTC
2008
IEEE
124views Communications» more  VTC 2008»
16 years 22 days ago
Long Length LDPC Code Construction and the Corresponding Decoder Implementation with Adjustable Parallelism
—In this paper, we propose a class of implementation friendly structured LDPC codes with low error floors. The proposed codes exhibit no apparent error floors as compared with qu...
Chia-Yu Lin, Mong-Kai Ku, Yi-Hsing Chien
FOCS
2007
IEEE
16 years 21 days ago
Polylogarithmic Independence Can Fool DNF Formulas
We show that any k-wise independent probability distribution on {0, 1}n O(m2.22− √ k/10)fools any boolean function computable by an m-clause DNF (or CNF) formula on n variable...
Louay Bazzi