985 search results - page 90 / 197 » Piercing Convex Sets |
165
click to vote
KDD
2012
ACM
13 years 6 months ago
2012
ACM
Traditional co-clustering methods identify block structures from static data matrices. However, the data matrices in many applications are dynamic; that is, they evolve smoothly o...
145
click to vote
SCIA
2005
Springer
15 years 10 months ago
2005
Springer
Experiments were carried out to investigate the possibility of training cellular automata to to perform processing. Currently, only binary images are considered, but the space of r...
141
click to vote
AIPS
2004
15 years 5 months ago
2004
Approximate linear programming (ALP) offers a promising framework for solving large factored Markov decision processes (MDPs) with both discrete and continuous states. Successful ...
137
click to vote
SIAMCOMP
2008
15 years 4 months ago
2008
Helly's theorem says that, if every d+1 elements of a given finite set of convex objects in Rd have a common point, there is a point common to all of the objects in the set. I...
120
click to vote
FOCM
2002
15 years 4 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...