895 search results - page 80 / 179 » Approximate convex decomposition |
122
click to vote
NIPS
2007
15 years 2 months ago
2007
Stability is a desirable characteristic for linear dynamical systems, but it is often ignored by algorithms that learn these systems from data. We propose a novel method for learn...
116
click to vote
CORR
2006
Springer
15 years 1 months ago
2006
Springer
Consider the problem of joint parameter estimation and prediction in a Markov random field: i.e., the model parameters are estimated on the basis of an initial set of data, and th...
132
click to vote
ISAAC
2007
Springer
15 years 7 months ago
2007
Springer
In this paper, we present two linear-size external memory data structures for approximate range searching. Our first structure, the BAR-B-tree, stores a set of N points in Rd and ...
130
click to vote
ICML
2010
IEEE
15 years 2 months ago
2010
IEEE
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...
101
click to vote
ICCSA
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...