Sciweavers

16404 search results - page 2785 / 3281
» A set coverage problem
Sort
View
NA
2008
144views more  NA 2008»
15 years 7 months ago
Another hybrid conjugate gradient algorithm for unconstrained optimization
Another hybrid conjugate gradient algorithm is subject to analysis. The parameter k is computed as a convex combination of HS k (Hestenes-Stiefel) and DY k (Dai-Yuan) algorithms, i...
Neculai Andrei
NAR
2008
67views more  NAR 2008»
15 years 7 months ago
EpiToolKit - a web server for computational immunomics
Predicting the T-cell-mediated immune response is an important task in vaccine design and thus one of the key problems in computational immunomics. Various methods have been devel...
Magdalena Feldhahn, Philipp Thiel, Mathias M. Schu...
FCSC
2007
108views more  FCSC 2007»
15 years 6 months ago
Offline Chinese handwriting recognition: an assessment of current technology
Offline Chinese handwriting recognition (OCHR) is a typically difficult pattern recognition problem. Many authors have presented various approaches to recognizing its different asp...
Sargur N. Srihari, Xuanshen Yang, Gregory R. Ball
NRHM
2008
93views more  NRHM 2008»
15 years 6 months ago
Semantics on demand: Can a Semantic Wiki replace a knowledge base?
In the same way that Wikis have become the mechanism that has enabled groups of users to collaborate on the production of hypertexts on the web, Semantic Wikis promise a future of...
David E. Millard, Chris Bailey, Philip Boulain, Sw...
ML
2006
ACM
15 years 6 months ago
Gleaner: Creating ensembles of first-order clauses to improve recall-precision curves
Many domains in the field of Inductive Logic Programming (ILP) involve highly unbalanced data. A common way to measure performance in these domains is to use precision and recall i...
Mark Goadrich, Louis Oliphant, Jude W. Shavlik
« Prev « First page 2785 / 3281 Last » Next »