Sciweavers

8728 search results - page 2 / 1746
» On Reduct Construction Algorithms
Sort
View
GBRPR
2003
Springer
13 years 10 months ago
Constructing Stochastic Pyramids by MIDES - Maximal Independent Directed Edge Set
Abstract. We present a new method (MIDES) to determine contraction kernels for the construction of graph pyramids. Experimentally the new method has a reduction factor higher than ...
Yll Haxhimusa, Roland Glantz, Walter G. Kropatsch
ISCAS
2006
IEEE
99views Hardware» more  ISCAS 2006»
13 years 11 months ago
MIMO interconnects order reductions by using the global Arnoldi algorithm
— We propose the global Arnoldi algorithm for MIMO RLCG interconnect model order reductions. This algorithm is an extension of the standard Arnoldi algorithm for systems with mul...
Ming-Hong Lai, Chia-Chi Chu, Wu-Shiung Feng
DCC
2009
IEEE
14 years 5 months ago
Linear Suffix Array Construction by Almost Pure Induced-Sorting
We present a linear time and space suffix array (SA) construction algorithm called the SA-IS algorithm. The SA-IS algorithm is novel because of the LMS-substrings used for the pro...
Ge Nong, Sen Zhang, Wai Hong Chan
VLSID
2005
IEEE
100views VLSI» more  VLSID 2005»
14 years 5 months ago
A Fast Buffered Routing Tree Construction Algorithm under Accurate Delay Model
Buffer insertion method plays a great role in modern VLSI design. Many buffer insertion algorithms have been proposed in recent years. However, most of them used simplified delay ...
Yibo Wang, Yici Cai, Xianlong Hong
ICDE
2003
IEEE
193views Database» more  ICDE 2003»
14 years 6 months ago
An Adaptive and Efficient Dimensionality Reduction Algorithm for High-Dimensional Indexing
The notorious "dimensionality curse" is a well-known phenomenon for any multi-dimensional indexes attempting to scale up to high dimensions. One well known approach to o...
Hui Jin, Beng Chin Ooi, Heng Tao Shen, Cui Yu, Aoy...