Sciweavers

2479 search results - page 439 / 496
» Random Event Structures
Sort
View
TPDS
2008
136views more  TPDS 2008»
13 years 7 months ago
Data Gathering with Tunable Compression in Sensor Networks
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...
Yang Yu, Bhaskar Krishnamachari, Viktor K. Prasann...
TWC
2008
110views more  TWC 2008»
13 years 7 months ago
Information outage probability and diversity order of symmetric coordinate interleaved orthogonal designs
Space-time block codes (STBCs) from coordinate interleaved orthogonal designs (CIODs) have attracted considerable attention lately due to their full-diversity and single-symbol dec...
Hoojin Lee, Jeffrey G. Andrews, Edward J. Powers
CORR
2004
Springer
119views Education» more  CORR 2004»
13 years 7 months ago
The Largest Compatible Subset Problem for Phylogenetic Data
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
Andy Auyeung, Ajith Abraham
IJAIT
2000
142views more  IJAIT 2000»
13 years 7 months ago
Adequacy of Limited Testing for Knowledge Based Systems
Knowledge-based engineering and computational intelligence are expected to become core technologies in the design and manufacturing for the next generation of space exploration mi...
Tim Menzies, Bojan Cukic
NN
2000
Springer
177views Neural Networks» more  NN 2000»
13 years 7 months ago
Independent component analysis: algorithms and applications
A fundamental problem in neural network research, as well as in many other disciplines, is finding a suitable representation of multivariate data, i.e. random vectors. For reasons...
Aapo Hyvärinen, Erkki Oja