Sciweavers

895 search results - page 51 / 179
» Approximate convex decomposition
Sort
View
ADCM
2010
129views more  ADCM 2010»
15 years 1 months ago
Construction of positive definite cubature formulae and approximation of functions via Voronoi tessellations
Let Rd be a compact convex set of positive measure. In a recent paper, we established a definiteness theory for cubature formulae of order two on . Here we study extremal propert...
Allal Guessab, Gerhard Schmeisser
TSMC
2002
119views more  TSMC 2002»
15 years 1 months ago
Approximation of n-dimensional data using spherical and ellipsoidal primitives
This paper discusses the problem of approximating data points in -dimensional Euclidean space using spherical and ellipsoidal surfaces. A closed form solution is provided for spher...
Giuseppe Carlo Calafiore
ICDE
2008
IEEE
129views Database» more  ICDE 2008»
16 years 2 months ago
Optimal Boolean Matrix Decomposition: Application to Role Engineering
Abstract-- A decomposition of a binary matrix into two matrices gives a set of basis vectors and their appropriate combination to form the original matrix. Such decomposition solut...
Haibing Lu, Jaideep Vaidya, Vijayalakshmi Atluri
HYBRID
2000
Springer
15 years 5 months ago
Approximate Reachability Analysis of Piecewise-Linear Dynamical Systems
In this paper we describe an experimental system called d=dt for approximating reachable states for hybrid systems whose continuous dynamics is de ned by linear di erential equatio...
Eugene Asarin, Thao Dang, Oded Maler, Olivier Bour...
AIPS
2004
15 years 2 months ago
Heuristic Refinements of Approximate Linear Programming for Factored Continuous-State Markov Decision Processes
Approximate linear programming (ALP) offers a promising framework for solving large factored Markov decision processes (MDPs) with both discrete and continuous states. Successful ...
Branislav Kveton, Milos Hauskrecht