16257 search results - page 100 / 3252 » D-finiteness: algorithms and applications |
KDD
2009
ACM
14 years 9 months ago
2009
ACM
Algorithms based on simulating stochastic flows are a simple and natural solution for the problem of clustering graphs, but their widespread use has been hampered by their lack of...
GECCO
2007
Springer
14 years 3 months ago
2007
Springer
E-commerce has transformed the way firms develop their pricing strategies, producing shift away from fixed pricing to dynamic pricing. In this paper, we use two different Estim...
APPROX
2004
Springer
14 years 2 months ago
2004
Springer
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....
EUROCOLT
1995
Springer
14 years 15 days ago
1995
Springer
k. The model we study can be interpreted as a broad, abstract extension of the well-studied on-line prediction model to a general decision-theoretic setting. We show that the multi...
ICASSP
2010
IEEE
13 years 3 months ago
2010
IEEE
In this paper we propose an iterative algorithm for solving the problem of extracting a sparse source signal when a reference signal for the desired source signal is available. In...