2373 search results - page 310 / 475 » Complexities for generalized models of self-assembly |
198
click to vote
IDA
2008
Springer
15 years 6 months ago
2008
Springer
We developed Relational Data Mining approach which allows to overcome essential limitations of the Data Mining and Knowledge Discovery techniques. In the paper the approach was im...
198
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
Recent technology trends in the Web Services (WS) domain indicate that a solution eliminating the presumed complexity of the WS-* standards may be in sight: advocates of REpresent...
221
click to vote
ESSMAC
2003
Springer
15 years 11 months 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...
181
click to vote
ANCS
2007
ACM
15 years 10 months ago
2007
ACM
Programming specialized network processors (NPU) is inherently difficult. Unlike mainstream processors where architectural features such as out-of-order execution and caches hide ...
180
click to vote
JACM
2000
15 years 6 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...