Sciweavers

2610 search results - page 143 / 522
» codes 2007
Sort
View
127
Voted
PRL
2007
150views more  PRL 2007»
15 years 3 months ago
A method for initialising the K-means clustering algorithm using kd-trees
We present a method for initialising the K-means clustering algorithm. Our method hinges on the use of a kd-tree to perform a density estimation of the data at various locations. ...
Stephen J. Redmond, Conor Heneghan
GLOBECOM
2007
IEEE
15 years 4 months ago
On Static Code Construction for Alternating Multicast and Simultaneous Multicasts
— In this paper, we introduce a network multicast problem called the alternating multicast problem. In this problem, there is more than one multicast on the network, but only one...
Chi Kin Ngai, Shenghao Yang, Raymond W. Yeung
CORR
2007
Springer
149views Education» more  CORR 2007»
15 years 3 months ago
Competitive minimax universal decoding for several ensembles of random codes
Universally achievable error exponents pertaining to certain families of channels (most notably, discrete memoryless channels (DMC’s)), and various ensembles of random codes, ar...
Yaniv Akirav, Neri Merhav
114
Voted
CPHYSICS
2007
80views more  CPHYSICS 2007»
15 years 3 months ago
Development of a parallelized 3D electrostatic PIC-FEM code and its applications
A parallelized three-dimensional self-consistent electrostatic particle-in-cell (PIC) code using unstructured tetrahedral mesh is proposed. Parallel implementation of the current ...
J.-S. Wu, K.-H. Hsu, F.-L. Li, C.-T. Hung, S.-Y. J...
DM
2007
83views more  DM 2007»
15 years 3 months ago
Codes identifying sets of vertices in random networks
In this paper we deal with codes identifying sets of vertices in random networks; that is, (1, ≤ ℓ)-identifying codes. These codes enable us to detect sets of faulty processor...
Alan M. Frieze, Ryan Martin, Julien Moncel, Mikl&o...