Sciweavers

1857 search results - page 251 / 372
» Minimum Degree Orderings
Sort
View
TWC
2008
131views more  TWC 2008»
15 years 6 months ago
On channel estimation and optimal training design for amplify and forward relay networks
In this paper, we provide a complete study on the training based channel estimation issues for relay networks that employ the amplify-and-forward (AF) transmission scheme. We first...
Feifei Gao, Tao Cui, Arumugam Nallanathan
VLC
2008
156views more  VLC 2008»
15 years 6 months ago
An agent-based framework for sketched symbol interpretation
Recognizing hand-sketched symbols is a definitely complex problem. The input drawings are often intrinsically ambiguous, and require context to be interpreted in a correct way. Ma...
Giovanni Casella, Vincenzo Deufemia, Viviana Masca...
COMBINATORICS
2004
115views more  COMBINATORICS 2004»
15 years 6 months ago
Dense Packings of Equal Spheres in a Cube
We describe an adaptation of the billiard algorithm for finding dense packings of equal spheres inside a domain of the euclidean space. In order to improve the convergence of this...
Thierry Gensane
IJCM
2002
92views more  IJCM 2002»
15 years 6 months ago
Random-tree Diameter and the Diameter-constrained MST
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
Ayman Abdalla, Narsingh Deo
CORR
1998
Springer
82views Education» more  CORR 1998»
15 years 6 months ago
Name Strategy: Its Existence and Implications
It is argued that colour name strategy, object name strategy, and chunking strategy in memory are all aspects of the same general phenomena, called stereotyping, and this in turn ...
Mark D. Roberts