536 search results - page 48 / 108 » Some Lower Bounds for the Complexity of Continuation Methods |
119
click to vote
GPEM
2007
15 years 1 months ago
2007
Our rapidly growing knowledge regarding genetic variation in the human genome offers great potential for understanding the genetic etiology of disease. This, in turn, could revolut...
KDD
1997
ACM
15 years 6 months ago
1997
ACM
Many classification algorithms are designed to work with datasets that contain only discrete attributes. Discretization is the process of converting the continuous attributes of ...
125
click to vote
CRV
2009
IEEE
15 years 8 months ago
2009
IEEE
In this paper we introduce the concept and method for adaptively tuning the model complexity in an online manner as more examples become available. Challenging classification pro...
104
click to vote
WCC
2005
Springer
15 years 7 months ago
2005
Springer
The security of the RSA public key cryptosystem depends on the intractability of the integer factoring problem. This paper shall give some theoretical support to the assumption of ...
103
click to vote
CSFW
1996
IEEE
15 years 6 months ago
1996
IEEE
: This paper examines some of the theoretical foundations of the distributable change detection method introduced by Forrest et al. in [10], including fundamental bounds on some of...