Sciweavers

387 search results - page 49 / 78
» Mining Approximative Descriptions of Sets Using Rough Sets
Sort
View
IJRR
2000
121views more  IJRR 2000»
13 years 7 months ago
Reconstructing the Shape of a Deformable Membrane from Image Data
In this paper, we study the problem of determining a mathematical description of the surface defined by the shape of a membrane based on an image of it and present an algorithm fo...
Nicola J. Ferrier, Roger W. Brockett
FMSD
2006
104views more  FMSD 2006»
13 years 7 months ago
Some ways to reduce the space dimension in polyhedra computations
Convex polyhedra are often used to approximate sets of states of programs involving numerical variables. The manipulation of convex polyhedra relies on the so-called double descri...
Nicolas Halbwachs, David Merchat, Laure Gonnord
UAI
2008
13 years 9 months ago
Clique Matrices for Statistical Graph Decomposition and Parameterising Restricted Positive Definite Matrices
We introduce Clique Matrices as an alternative representation of undirected graphs, being a generalisation of the incidence matrix representation. Here we use clique matrices to d...
David Barber
ACCV
2010
Springer
13 years 2 months ago
One-Class Classification with Gaussian Processes
Detecting instances of unknown categories is an important task for a multitude of problems such as object recognition, event detection, and defect localization. This paper investig...
Michael Kemmler, Erik Rodner, Joachim Denzler
GECCO
2007
Springer
161views Optimization» more  GECCO 2007»
14 years 1 months ago
Alternative techniques to solve hard multi-objective optimization problems
In this paper, we propose the combination of different optimization techniques in order to solve “hard” two- and threeobjective optimization problems at a relatively low comp...
Ricardo Landa Becerra, Carlos A. Coello Coello, Al...