16430 search results - page 180 / 3286 » On Computable Tree Functions |
129
click to vote
EOR
2008
15 years 3 months ago
2008
The aim of this paper is to apply the concept of robust optimization introduced by Bel-Tal and Nemirovski to the portfolio selection problems based on multi-stage scenario trees. ...
180
click to vote
BMCBI
2008
15 years 4 months ago
2008
Background: A fundamental problem when trying to define the functional relationships between proteins is the difficulty in quantifying functional similarities, even when well-stru...
117
click to vote
ISAAC
2007
Springer
15 years 10 months ago
2007
Springer
Let C denote a set of n mobile clients, each of which follows a continuous trajectory on a weighted tree T. We establish tight bounds on the maximum relative velocity of the 1-cent...
134
click to vote
ICDM
2003
IEEE
15 years 9 months ago
2003
IEEE
Most data mining algorithms and tools stop at discovered customer models, producing distribution information on customer profiles. Such techniques, when applied to industrial pro...
154
click to vote
NIPS
1990
15 years 5 months ago
1990
A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. A...