4539 search results - page 239 / 908 » Approaches to Compute Workflow Complexity |
160
Voted
BMCBI
2008
15 years 5 months ago
2008
Background: Genome survey sequences (GSS) offer a preliminary global view of a genome since, unlike ESTs, they cover coding as well as non-coding DNA and include repetitive region...
167
click to vote
CGI
1998
IEEE
15 years 9 months ago
1998
IEEE
In the scope of rendering complex models with high depth complexity, it is of great importance to design outputsensitive algorithms, i.e., algorithms with the time complexity prop...
140
click to vote
ISCAS
2007
IEEE
15 years 12 months ago
2007
IEEE
Abstract— Approximation of Toeplitz matrices with circulant matrices is a well-known approach to reduce the computational complexity of linear equalizers. This paper presents a n...
171
click to vote
ICPR
2004
IEEE
16 years 6 months ago
2004
IEEE
Model selection in unsupervised learning is a hard problem. In this paper a simple selection criterion for hyperparameters in one-class classifiers (OCCs) is proposed. It makes us...
171
click to vote
VISUALIZATION
1995
IEEE
15 years 9 months ago
1995
IEEE
In the research described here, we have constructed at tightly coupled set of methods for monitoring, steering, and applying visual analysis to large scale simulations. This work ...