Sciweavers

1258 search results - page 126 / 252
» Architecture-driven Problem Decomposition
Sort
View
ICML
2004
IEEE
14 years 2 months ago
Active learning of label ranking functions
The effort necessary to construct labeled sets of examples in a supervised learning scenario is often disregarded, though in many applications, it is a time-consuming and expensi...
Klaus Brinker
IOR
2011
220views more  IOR 2011»
13 years 4 months ago
Optimal Inventory Policies when Purchase Price and Demand Are Stochastic
In this paper we consider the problem of a firm that faces a stochastic (Poisson) demand and must replenish from a market in which prices fluctuate, such as a commodity market. ...
Peter Berling, Victor Martínez-de-Alb&eacut...
TCS
2011
13 years 4 months ago
Dynamic normal forms and dynamic characteristic polynomial
Abstract. We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case our algorithm supports rank-one updat...
Gudmund Skovbjerg Frandsen, Piotr Sankowski
MA
2010
Springer
150views Communications» more  MA 2010»
13 years 3 months ago
Cokriging for spatial functional data
This work proposes to generalize the method of cokriging when data are spatially sampled curves. A spatial functional linear model is constructed including spatial dependencies be...
David Nerini, Pascal Monestiez, Claude Manté...
SIAMREV
2010
114views more  SIAMREV 2010»
13 years 3 months ago
From Random Polygon to Ellipse: An Eigenanalysis
Suppose x and y are unit 2-norm n-vectors whose components sum to zero. Let P(x, y) be the polygon obtained by connecting (x1, y1), . . . , (xn, yn), (x1, y1) in order. We say that...
Adam N. Elmachtoub, Charles F. Van Loan