985 search results - page 119 / 197 » Piercing Convex Sets |
116
click to vote
TKDE
2002
15 years 4 months ago
2002
We consider the problem of finding a set of attribute values that give a high quality binary segmentation of a database. The quality of a segmentation is defined by an objective fu...
123
click to vote
PKDD
2010
Springer
15 years 2 months ago
2010
Springer
There are many situations in which we have more than one view of a single data source, or in which we have multiple sources of data that are aligned. We would like to be able to bu...
171
Voted
SIAMCO
2011
14 years 11 months ago
2011
We study properties of solutions to fully nonlinear versions of the standard Black– Scholes partial differential equation. These equations have been introduced in financial mat...
150
click to vote
JMLR
2010
14 years 11 months ago
2010
We consider regularized stochastic learning and online optimization problems, where the objective function is the sum of two convex terms: one is the loss function of the learning...
117
click to vote
GD
2009
Springer
15 years 9 months ago
2009
Springer
Let n ≥ 4 be even. It is shown that every set S of n points in the plane can be connected by a (possibly self-intersecting) spanning tour (Hamiltonian cycle) consisting of n str...