1523 search results - page 212 / 305 » The Computational Complexity of Linear Optics |
130
click to vote
ICANN
1997
Springer
15 years 7 months ago
1997
Springer
Abstract. In this paper we compare two methods for intrinsic dimensionality (ID) estimation based on optimally topology preserving maps (OTPMs). The rst one is a direct approach, w...
150
click to vote
ICWS
2008
IEEE
15 years 5 months ago
2008
IEEE
Service-oriented computing (SOC) has emerged as the eminent market environment for sharing and reusing service-centric capabilities. The underpinning for an organization's us...
122
click to vote
IJCAI
2007
15 years 5 months ago
2007
Temporal reasoning is widely used within both Computer Science and A.I. However, the underlying complexity of temporal proof in discrete temporal logics has led to the use of simp...
143
click to vote
HIS
2004
15 years 5 months ago
2004
Boosting is a general method for improving the accuracy of a learning algorithm. AdaBoost, short form for Adaptive Boosting method, consists of repeated use of a weak or a base le...
118
Voted
ENTCS
2010
15 years 3 months ago
2010
Molecular biological models usually suffer from a large combinatorial explosion. Indeed, proteins form complexes and modify each others, which leads to the formation of a huge num...