429 search results - page 69 / 86 » Anti-unification Algorithms and Their Applications in Progra... |
122
click to vote
LATIN
2010
Springer
15 years 8 months ago
2010
Springer
In this paper, we consider Steiner forest and its generalizations, prize-collecting Steiner forest and k-Steiner forest, when the vertices of the input graph are points in the Euc...
126
click to vote
JGO
2010
14 years 10 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
194
click to vote
ESA
2010
Springer
15 years 4 months ago
2010
Springer
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
114
Voted
BMCBI
2005
15 years 3 months ago
2005
Background: Interpreting the results of high-throughput experiments, such as those obtained from DNA-microarrays, is an often time-consuming task due to the high number of data-po...
162
Voted
CIVR
2007
Springer
15 years 9 months ago
2007
Springer
Over the years, many Linear Discriminant Analysis (LDA) algorithms have been proposed for the study of high dimensional data in a large variety of problems. An intrinsic limitatio...