Sciweavers

956 search results - page 14 / 192
» Source Constrained Clustering
Sort
View
DCC
2008
IEEE
14 years 9 months ago
A Lower Bound on the Redundancy of Arithmetic-Type Delay Constrained Coding
In a previous paper we derived an upper bound on the redundancy of an arithmetic-type encoder for a memoryless source, designed to meet a finite endto-end strict delay constraint....
Eado Meron, Ofer Shayevitz, Meir Feder, Ram Zamir
EWSN
2007
Springer
14 years 9 months ago
An Energy-Efficient K-Hop Clustering Framework for Wireless Sensor Networks
Many applications in wireless sensor networks (WSNs) benefit significantly from organizing nodes into groups, called clusters, because data aggregation and data filtering applied i...
Quanbin Chen, Jian Ma, Yanmin Zhu, Dian Zhang, Lio...
ICDM
2007
IEEE
149views Data Mining» more  ICDM 2007»
14 years 4 months ago
Solving Consensus and Semi-supervised Clustering Problems Using Nonnegative Matrix Factorization
Consensus clustering and semi-supervised clustering are important extensions of the standard clustering paradigm. Consensus clustering (also known as aggregation of clustering) ca...
Tao Li, Chris H. Q. Ding, Michael I. Jordan
ESAS
2007
Springer
14 years 4 months ago
Detecting Node Compromise in Hybrid Wireless Sensor Networks Using Attestation Techniques
Abstract. Node compromise is a serious threat in wireless sensor networks. Particular in networks which are organized in clusters, nodes acting as cluster heads for many cluster no...
Christoph Krauß, Frederic Stumpf, Claudia M....
GD
2008
Springer
13 years 11 months ago
Topology Preserving Constrained Graph Layout
Abstract. Constrained graph layout is a recent generalisation of forcedirected graph layout which allows constraints on node placement. We give a constrained graph layout algorithm...
Tim Dwyer, Kim Marriott, Michael Wybrow