Sciweavers

49 search results - page 1 / 10
» Some ways to reduce the space dimension in polyhedra computa...
Sort
View
FMSD
2006
104views more  FMSD 2006»
13 years 4 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
ANOR
2005
131views more  ANOR 2005»
13 years 4 months ago
Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization
Abstract. This is an overview of the significance and main uses of projection, lifting and extended formulation in integer and combinatorial optimization. Its first two sections de...
Egon Balas
ICPR
2006
IEEE
13 years 11 months ago
Fast Feature Extraction Approach for Multi-Dimension Feature Space Problems
Recently, we proposed a fast feature extraction approach denoted FSOM utilizes Self Organizing Map (SOM). FSOM [1] overcomes the slowness of traditional SOM search algorithm. We i...
Alaa El. Sagheer, Naoyuki Tsuruta, Rin-ichiro Tani...
IPPS
1998
IEEE
13 years 9 months ago
Virtual FPGAs: Some Steps Behind the Physical Barriers
Recent advances in FPGA technologies allow to configure the RAM-based FPGA devices in a reduced time as an effective support for real-time applications. The physical dimensions of ...
William Fornaciari, Vincenzo Piuri
SYRCODIS
2007
126views Database» more  SYRCODIS 2007»
13 years 6 months ago
Concept Lattice Reduction by Singular Value Decomposition
High complexity of lattice construction algorithms and uneasy way of visualising lattices are two important problems connected with the formal concept analysis. Algorithm complexi...
Václav Snásel, Martin Polovincak, Hu...