Sciweavers

3591 search results - page 119 / 719
» Typing linear constraints
Sort
View
ICASSP
2011
IEEE
14 years 1 months ago
Linear precoding for time-varying MIMO channels with low-complexity receivers
This paper considers linear precoding for time-varying multipleinput multiple-output (MIMO) channels. We show that linear minimum mean-squared error (LMMSE) equalization based on ...
Jun Tong, Peter J. Schreier, Steven R. Weller, Lou...
ICFP
2005
ACM
15 years 10 months ago
A unified category-theoretic formulation of typed binding signatures
We generalise Fiore et al's account of variable binding for untyped cartesian contexts and Tanaka's account of variable binding for untyped linear contexts to give an ac...
Miki Tanaka, John Power
BMCBI
2007
144views more  BMCBI 2007»
14 years 10 months ago
Application of amino acid occurrence for discriminating different folding types of globular proteins
Background: Predicting the three-dimensional structure of a protein from its amino acid sequence is a long-standing goal in computational/molecular biology. The discrimination of ...
Y.-h. Taguchi, M. Michael Gromiha
CP
2009
Springer
15 years 10 months ago
Confidence-Based Work Stealing in Parallel Constraint Programming
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
Geoffrey Chu, Christian Schulte, Peter J. Stuckey
VTC
2008
IEEE
125views Communications» more  VTC 2008»
15 years 4 months ago
A General Formula for Log-MGF Computation: Application to the Approximation of Log-Normal Power Sum via Pearson Type IV Distribu
Abstract— In [1], we have recently proposed a general approach for approximating the power sum of Log–Normal Random Variables (RVs) by using the Pearson system of distributions...
Marco Di Renzo, Fabio Graziosi, Fortunato Santucci