Sciweavers

359 search results - page 25 / 72
» Solving Geometric Covering Problems by Data Reduction
Sort
View
ITC
2002
IEEE
72views Hardware» more  ITC 2002»
14 years 1 months ago
Test Point Insertion that Facilitates ATPG in Reducing Test Time and Data Volume
Efficient production testing is frequently hampered because current digital circuits require test sets which are too large. These test sets can be reduced significantly by means...
M. J. Geuzebroek, J. Th. van der Linden, A. J. van...
AUTOMATICA
2011
13 years 4 months ago
Sequential linear quadratic control of bilinear parabolic PDEs based on POD model reduction
We present a framework to solve a finite-time optimal control problem for parabolic partial differential equations (PDEs) with diffusivity-interior actuators, which is motivate...
Chao Xu, Yongsheng Ou, Eugenio Schuster
MICCAI
2009
Springer
14 years 10 months ago
Setting Priors and Enforcing Constraints on Matches for Nonlinear Registration of Meshes
Abstract. We show that a simple probabilistic modelling of the registration problem for surfaces allows to solve it by using standard clustering techniques. In this framework, poin...
Benoît Combès, Sylvain Prima
ICDE
2008
IEEE
155views Database» more  ICDE 2008»
14 years 10 months ago
Lattice Histograms: a Resilient Synopsis Structure
Despite the surge of interest in data reduction techniques over the past years, no method has been proposed to date that can always achieve approximation quality preferable to that...
Panagiotis Karras, Nikos Mamoulis
TAMC
2007
Springer
14 years 3 months ago
Kernelizations for Parameterized Counting Problems
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
Marc Thurley