17129 search results - page 3263 / 3426 » Applied Computing |
138
click to vote
BMCBI
2008
15 years 3 months ago
2008
Background: Inference of evolutionary trees using the maximum likelihood principle is NP-hard. Therefore, all practical methods rely on heuristics. The topological transformations...
138
click to vote
FCT
2009
Springer
15 years 9 months ago
2009
Springer
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
155
click to vote
ASC
2010
15 years 3 months ago
2010
Grammatical evolution (GE) is a form of grammar-based genetic programming. A particular feature of GE is that it adopts a distinction between the genotype and phenotype similar to...
110
click to vote
MOC
2000
15 years 2 months ago
2000
The iteratively regularized Gauss-Newton method is applied to compute the stable solutions to nonlinear ill-posed problems F (x) = y when the data y is given approximately by y wit...
148
click to vote
KDD
2010
ACM
15 years 1 months ago
2010
ACM
Scalable similarity search is the core of many large scale learning or data mining applications. Recently, many research results demonstrate that one promising approach is creatin...