71 search results - page 10 / 15 » Testing Problems with Sub-Learning Sample Complexity |
MOC
1998
13 years 7 months ago
1998
Abstract. An iterative procedure for numerical conformal mapping is presented which imposes no restriction on the boundary complexity. The formulation involves two analytically equ...
PLDI
2005
ACM
14 years 28 days ago
2005
ACM
Reuse of existing code from class libraries and frameworks is often difficult because APIs are complex and the client code required to use the APIs can be hard to write. We obser...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Given a sample covariance matrix, we examine the problem of maximizing the variance explained by a linear combination of the input variables while constraining the number of nonze...
ASSETS
2007
ACM
13 years 11 months ago
2007
ACM
The World Wide Web (Web) is a visually complex, multimedia system that can be inaccessible to people with visual impairments. SADIe addresses this problem by using Semantic Web te...
BMCBI
2002
13 years 7 months ago
2002
Background: A method to evaluate and analyze the massive data generated by series of microarray experiments is of utmost importance to reveal the hidden patterns of gene expressio...