Sciweavers

3946 search results - page 186 / 790
» The computational complexity of choice sets
Sort
View
BIRTHDAY
2007
Springer
16 years 24 days ago
A Denotational Semantics for Handel-C
We present a denotational semantics for a fully functional subset of the Handel-C hardware compilation language [1], based on the concept of typed assertion traces. We motivate the...
Andrew Butterfield
ICCSA
2004
Springer
15 years 12 months ago
High Throughput in-silico Screening against Flexible Protein Receptors
We report results for the in-silico screening of a database of 10000 flexible compounds against various crystal structures of the thymidine kinase receptor complexed with 10 know...
Holger Merlitz, Wolfgang Wenzel
ISCAS
2003
IEEE
140views Hardware» more  ISCAS 2003»
15 years 12 months ago
On use of averaging in FxLMS algorithm for single-channel feedforward ANC systems
In this paper an active noise control (ANC) algorithm is proposed. This algorithm is based on adaptive filtering with averaging (AFA) and uses a similar structure as that of the F...
Muhammad Tahir Akhtar, Masahide Abe, Masayuki Kawa...
JSC
2008
78views more  JSC 2008»
15 years 6 months ago
Rational Univariate Reduction via toric resultants
We describe algorithms for solving a given system of multivariate polynomial equations via the Rational Univariate Reduction (RUR). We compute the RUR from the toric resultant of ...
Koji Ouchi, John Keyser
CAGD
2000
61views more  CAGD 2000»
15 years 6 months ago
Efficient evaluation of triangular B-spline surfaces
Evaluation routines are essential for any application that uses triangular B-spline surfaces. This paper describes an algorithm to efficiently evaluate triangular B-spline surface...
Michael Franssen, Remco C. Veltkamp, Wieger Wessel...