Sciweavers

214 search results - page 30 / 43
» Perfect and Almost Perfect Sequences
Sort
View
SIGMOD
2004
ACM
154views Database» more  SIGMOD 2004»
14 years 7 months ago
Computing Clusters of Correlation Connected Objects
The detection of correlations between different features in a set of feature vectors is a very important data mining task because correlation indicates a dependency between the fe...
Christian Böhm, Karin Kailing, Peer Krög...
GLOBECOM
2009
IEEE
14 years 2 months ago
Maximizing Lifetime of Sensor-Target Surveillance in Wireless Sensor Networks
—The paper addresses the maximal lifetime problem in sensor-target surveillance networks. Given a set of sensors and targets in an Euclidean plane, each sensor can watch all targ...
Hai Liu, Xiaowen Chu, Yiu-Wing Leung, Xiaohua Jia,...
SOUPS
2009
ACM
14 years 2 months ago
Games for extracting randomness
Randomness is a necessary ingredient in various computational tasks and especially in Cryptography, yet many existing mechanisms for obtaining randomness suffer from numerous pro...
Ran Halprin, Moni Naor
CDC
2008
IEEE
125views Control Systems» more  CDC 2008»
14 years 2 months ago
Dynamical structure analysis of sparsity and minimality heuristics for reconstruction of biochemical networks
— Network reconstruction, i.e. obtaining network structure from input-output information, is a central theme in systems biology. A variety of approaches aim to obtaining structur...
Russell Howes, Lee John Eccleston, Jorge M. Goncal...
ICC
2008
IEEE
125views Communications» more  ICC 2008»
14 years 2 months ago
Asymptotic Performance of DS-CDMA with Linear MMSE Receiver and Limited Feedback
Abstract—Signature quantization for reverse-link Direct Sequence (DS)- Code Division Multiple Access (CDMA) is considered. A receiver assumed to have perfect estimates of channel...
Wiroonsak Santipach