1391 search results - page 172 / 279 » Complexity Limitations on Quantum Computation |
143
click to vote
ESCIENCE
2006
IEEE
15 years 10 months ago
2006
IEEE
Scientific workflows are a powerful programming technique for specifying complex computations using a number of otherwise independent components. When used in a Grid environment, ...
119
click to vote
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
The prediction of protein 3D structure has become a hot research area in the post-genome era, through which people can understand a protein’s function in health and disease, exp...
109
Voted
ISCAS
2006
IEEE
15 years 10 months ago
2006
IEEE
— Fast QR decomposition RLS (FQRD-RLS) algorithms are well known for their good numerical properties and low computational complexity. The FQRD-RLS algorithms do not provide acce...
146
click to vote
CONEXT
2006
ACM
15 years 10 months ago
2006
ACM
In the context of a reconfigurable transport protocol, this paper introduces two protocol instances based on the composition and specialisation of the TFRC congestion control and...
132
click to vote
ICCAD
2005
IEEE
15 years 9 months ago
2005
IEEE
— Balanced truncation (BT) model order reduction (MOR) is known for its superior accuracy and computable error bounds. Balanced stochastic truncation (BST) is a particular BT pro...