Sciweavers

4745 search results - page 190 / 949
» Discretization: An Enabling Technique
Sort
View
COMPGEOM
1993
ACM
15 years 10 months ago
Approximating Center Points with Iterated Radon Points
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
Kenneth L. Clarkson, David Eppstein, Gary L. Mille...
E4MAS
2004
Springer
15 years 10 months ago
Modelling Environments for Distributed Simulation
Abstract. Decentralised, event-driven distributed simulation is particularly suitable for modelling systems with inherent asynchronous parallelism, such as agentbased systems. Howe...
Michael Lees, Brian Logan, Rob Minson, Ton Oguara,...
ECML
2006
Springer
15 years 10 months ago
Sequence Discrimination Using Phase-Type Distributions
Abstract We propose in this paper a novel approach to the classification of discrete sequences. This approach builds a model fitting some dynamical features deduced from the learni...
Jérôme Callut, Pierre Dupont
ECML
2006
Springer
15 years 10 months ago
Combinatorial Markov Random Fields
Abstract. A combinatorial random variable is a discrete random variable defined over a combinatorial set (e.g., a power set of a given set). In this paper we introduce combinatoria...
Ron Bekkerman, Mehran Sahami, Erik G. Learned-Mill...
COMPGEOM
2001
ACM
15 years 10 months ago
Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually!
We present two approaches to the problem of calculating a cell in a 3-dimensional arrangement of quadrics. The first approach solves the problem using rational arithmetic. It work...
Nicola Geismann, Michael Hemmer, Elmar Schöme...