Sciweavers

479 search results - page 30 / 96
» An Algebra of Pareto Points
Sort
View
AIPS
2008
15 years 8 min ago
Efficient ADD Operations for Point-Based Algorithms
During the past few years, point-based POMDP solvers have gradually scaled up to handle medium sized domains through better selection of the set of points and efficient backup met...
Guy Shani, Pascal Poupart, Ronen I. Brafman, Solom...
DLT
2008
14 years 11 months ago
Derivation Tree Analysis for Accelerated Fixed-Point Computation
We show that for several classes of idempotent semirings the least fixed-point of a polynomial system of equations X = f(X) is equal to the least fixed-point of a linear system obt...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
81
Voted
IJCGA
2006
85views more  IJCGA 2006»
14 years 9 months ago
Some Lower Bounds on Geometric Separability Problems
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show (n log n) time lower bounds for sep...
Esther M. Arkin, Ferran Hurtado, Joseph S. B. Mitc...
ISSAC
1995
Springer
125views Mathematics» more  ISSAC 1995»
15 years 1 months ago
Numeric-Symbolic Algorithms for Evaluating One-Dimensional Algebraic Sets
: We present e cient algorithms based on a combination of numeric and symbolic techniques for evaluating one-dimensional algebraic sets in a subset of the real domain. Given a desc...
Shankar Krishnan, Dinesh Manocha
CG
2005
Springer
14 years 9 months ago
Geometric computing in computer graphics using conformal geometric algebra
Early in the development of Computer Graphics it was realized that projective geometry was well suited for the representation of transformations. Now, it seems that another change...
Dietmar Hildenbrand