6142 search results - page 764 / 1229 » The Complexity of Partition Functions |
165
click to vote
TIT
1998
15 years 6 months ago
1998
— The Godard or the constant modulus algorithm (CMA) is an effective technique for blind receiver design in communications. However, due to the complexity of the Constant Modulus...
163
click to vote
TOG
2002
15 years 6 months ago
2002
Several techniques have been developed to approximate Bidirectional Reflectance Distribution Functions (BRDF) with acceptable quality and performance for realtime applications. Th...
197
click to vote
MST
2007
15 years 6 months ago
2007
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Edalat–Potts in type theory. We choose the constructive type theory extended with coind...
185
click to vote
PRL
2007
15 years 6 months ago
2007
This paper proposes a novel nonparametric clustering algorithm capable of identifying shape-free clusters. This algorithm is based on a nonparametric estimation of the normalized ...
225
click to vote
TVLSI
2008
15 years 6 months ago
2008
With increasing levels of integration of multiple processing cores and new features to support software functionality, recent generations of microprocessors face difficult validati...