2434 search results - page 156 / 487 » Algorithmic Randomness of Closed Sets |
114
Voted
FOCM
2002
15 years 3 months ago
2002
We consider the Riemannian geometry defined on a convex set by the Hessian of a selfconcordant barrier function, and its associated geodesic curves. These provide guidance for the...
121
click to vote
ACL
2009
15 years 1 months ago
2009
This paper presents an efficient inference algorithm of conditional random fields (CRFs) for large-scale data. Our key idea is to decompose the output label state into an active s...
122
Voted
STOC
2003
ACM
16 years 4 months ago
2003
ACM
Boosting algorithms are procedures that "boost" low-accuracy weak learning algorithms to achieve arbitrarily high accuracy. Over the past decade boosting has been widely...
183
Voted
TEC
2012
13 years 6 months ago
2012
—This paper presents a new cooperative coevolving particle swarm optimization (CCPSO) algorithm in an attempt to address the issue of scaling up particle swarm optimization (PSO)...
133
Voted
ECCC
2010
15 years 3 months ago
2010
Suppose a decision maker has to purchase a commodity over time with varying prices and demands. In particular, the price per unit might depend on the amount purchased and this pri...