Sciweavers

620 search results - page 96 / 124
» A Simple and Fast Min-cut Algorithm
Sort
View
AMCS
2008
146views Mathematics» more  AMCS 2008»
14 years 12 months ago
Fault Detection and Isolation with Robust Principal Component Analysis
Principal component analysis (PCA) is a powerful fault detection and isolation method. However, the classical PCA which is based on the estimation of the sample mean and covariance...
Yvon Tharrault, Gilles Mourot, José Ragot, ...
FOCM
2007
55views more  FOCM 2007»
14 years 11 months ago
On Location and Approximation of Clusters of Zeros: Case of Embedding Dimension One
Isolated multiple zeros or clusters of zeros of analytic maps with several variables are known to be difficult to locate and approximate. This article is in the vein of the α-theo...
Marc Giusti, Grégoire Lecerf, Bruno Salvy, ...
JMMA
2002
90views more  JMMA 2002»
14 years 11 months ago
Implicit Convex Polygons
Convex polygons in the plane can be defined explicitly as an ordered list of vertices, or given implicitly, for example by a list of linear constraints. The latter representation h...
Francisco Gómez, Ferran Hurtado, Suneeta Ra...
FUIN
2010
93views more  FUIN 2010»
14 years 10 months ago
SAT as a Programming Environment for Linear Algebra
In this paper we present an application of the propositional SATisfiability environment to computing some simple orthogonal matrices and some interesting tasks in the area of cry...
Marian Srebrny, Lidia Stepien
TAPAS
2011
286views Algorithms» more  TAPAS 2011»
14 years 6 months ago
Alternative Route Graphs in Road Networks
Every human likes choices. But today’s fast route planning algorithms usually compute just a single route between source and target. There are beginnings to compute alternative r...
Roland Bader, Jonathan Dees, Robert Geisberger, Pe...