187 search results - page 26 / 38 » Computing Special Values of Partial Zeta Functions |
SODA
2008
ACM
15 years 1 months ago
2008
ACM
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
ICDM
2003
IEEE
15 years 5 months ago
2003
IEEE
A novel approach to clustering co-occurrence data poses it as an optimization problem in information theory which minimizes the resulting loss in mutual information. A divisive cl...
109
click to vote
EUSFLAT
2001
15 years 1 months ago
2001
In analogy to the representation of the standard probabilistic average as an expected value of a random variable, a geometric approach to aggregation is proposed. Several properti...
133
click to vote
CVPR
2009
IEEE
16 years 7 months ago
2009
IEEE
We propose an algorithm that simultaneously extracts
disparities and alpha matting information given a stereo
image pair. Our method divides the reference image into
a set of ov...
123
click to vote
NECO
2011
14 years 6 months ago
2011
Selection of an optimal estimator typically relies on either supervised training samples (pairs of measurements and their associated true values), or a prior probability model for...