414 search results - page 29 / 83 » On discrete norms of polynomials |
161
click to vote
PAMI
2010
15 years 4 months ago
2010
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
200
click to vote
COMPGEOM
2011
ACM
14 years 9 months ago
2011
ACM
We report on a generic uni- and bivariate algebraic kernel that is publicly available with Cgal 3.7. It comprises complete, correct, though efficient state-of-the-art implementati...
185
click to vote
SIAMNUM
2010
15 years 24 days ago
2010
We derive a posteriori error estimates for the discretization of the heat equation in a unified and fully discrete setting comprising the discontinuous Galerkin, finite volume, mix...
155
click to vote
COCOON
2009
Springer
16 years 19 days ago
2009
Springer
We present a polynomial-time perfect sampler for the Q-Ising with a vertex-independent noise. The Q-Ising, one of the generalized models of the Ising, arose in the context of Baye...
167
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
Abstract We consider a variant of the path cover problem, namely, the k-fixedendpoint path cover problem, or kPC for short, on interval graphs. Given a graph G and a subset T of k ...