3946 search results - page 315 / 790 » The computational complexity of choice sets |
226
click to vote
ESSMAC
2003
Springer
16 years 20 hour ago
2003
Springer
Abstract. While there is strong motivation for using Gaussian Processes (GPs) due to their excellent performance in regression and classification problems, their computational com...
193
click to vote
EAGC
2004
Springer
16 years 6 days ago
2004
Springer
AS complexity of computational applications and their environments has been increased due to the heterogeneity of resources; complexity, continuous changes of the applications as w...
162
click to vote
IPPS
2003
IEEE
16 years 2 days ago
2003
IEEE
This work targets the emerging use of software component technology for high-performance scientific parallel and distributed computing. While component software engineering will ...
193
click to vote
CONCUR
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Polynomially accurate simulations [19] are relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation len...
173
click to vote
TKDE
2008
15 years 6 months ago
2008
Mixed-drove spatiotemporal co-occurrence patterns (MDCOPs) represent subsets of two or more different object-types whose instances are often located in spatial and temporal proximi...