Sciweavers

8728 search results - page 30 / 1746
» On Reduct Construction Algorithms
Sort
View
WALCOM
2010
IEEE
255views Algorithms» more  WALCOM 2010»
14 years 3 months ago
A Global k-Level Crossing Reduction Algorithm
Abstract. Directed graphs are commonly drawn by the Sugiyama algorithm, where crossing reduction is a crucial phase. It is done by repeated one-sided 2-level crossing minimizations...
Christian Bachmaier, Franz-Josef Brandenburg, Wolf...
CORR
2008
Springer
139views Education» more  CORR 2008»
13 years 9 months ago
Generalized Traveling Salesman Problem Reduction Algorithms
The generalized traveling salesman problem (GTSP) is an extension of the well-known traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are ...
Gregory Gutin, Daniel Karapetyan
ICPR
2008
IEEE
14 years 10 months ago
An empirical comparison of graph-based dimensionality reduction algorithms on facial expression recognition tasks
Facial expression recognition is a topic of interest both in industry and academia. Recent approaches to facial expression recognition are based on mapping expressions to low dime...
José Miguel Buenaposada, Li He, Luis Baumel...
PARA
2004
Springer
14 years 2 months ago
Parallel Algorithms for Balanced Truncation Model Reduction of Sparse Systems
We describe the parallelization of an efficient algorithm for balanced truncation that allows to reduce models with state-space dimension up to O(105 ). The major computational tas...
José M. Badía, Peter Benner, Rafael ...
EURODAC
1995
IEEE
164views VHDL» more  EURODAC 1995»
14 years 12 days ago
Bottleneck removal algorithm for dynamic compaction and test cycles reduction
: We present a new, dynamic algorithm for test sequence compaction and test cycle reduction for combinationaland sequential circuits. Several dynamic algorithms for compaction in c...
Srimat T. Chakradhar, Anand Raghunathan