Sciweavers

147 search results - page 9 / 30
» Adaptive methods for netlist partitioning
Sort
View
VMV
2003
154views Visualization» more  VMV 2003»
14 years 11 months ago
Piecewise Linear Approximation of Signed Distance Fields
The signed distance field of a surface can effectively support many geometry processing tasks such as decimation, smoothing, and Boolean operations since it provides efficient a...
Jianhua Wu, Leif Kobbelt
ICIP
2008
IEEE
15 years 11 months ago
Multiscale recurrent pattern image coding with a flexible partition scheme
In this paper we present a new segmentation method for the Multidimensional Multiscale Parser (MMP) algorithm. In previous works we have shown that, for text and compound images, ...
Eduardo A. B. da Silva, Manuel J. C. S. Reis, Muri...
JSCIC
2006
72views more  JSCIC 2006»
14 years 9 months ago
Space-Time Adaptive Solution of First Order PDES
An explicit time-stepping method is developed for adaptive solution of time-dependent partial differential equations with first order derivatives. The space is partitioned into bl...
Lars Ferm, Per Lötstedt
CVPR
2011
IEEE
14 years 5 months ago
Adapting an Object Detector by Considering the Worst Case: a Conservative Approach
The performance of an offline-trained classifier can be improved on-site by adapting the classifier towards newly acquired data. However, the adaptation rate is a tuning parame...
Guang Chen, TonyX. Han
MOC
2002
92views more  MOC 2002»
14 years 9 months ago
Error indicators for the mortar finite element discretization of the Laplace equation
The mortar technique turns out to be well adapted to handle mesh adaptivity in finite elements, since it allows for working with nonnecessarily compatible discretizations on the el...
Christine Bernardi, Frédéric Hecht