Sciweavers

2969 search results - page 42 / 594
» A space efficient algorithm for group structure computation
Sort
View
DAC
1996
ACM
15 years 7 months ago
Efficient Approximation Algorithms for Floorplan Area Minimization
Approximation has been shown to be an eective method for reducing the time and space costs of solving various oorplan area minimization problems. In this paper, we present several...
Danny Z. Chen, Xiaobo Hu
APPML
2010
112views more  APPML 2010»
15 years 3 months ago
Computing Fourier transforms and convolutions of Sn-1-invariant signals on Sn in time linear in n
Let Sn denote the symmetric group on {1, . . . , n} and Sn-1 the stabilizer subgroup of n. We derive algorithms for computing Fourier transforms of left and right Sn-1-invariant s...
Michael Clausen, Ramakrishna Kakarala
SIGMOD
2004
ACM
196views Database» more  SIGMOD 2004»
16 years 3 months ago
FARMER: Finding Interesting Rule Groups in Microarray Datasets
Microarray datasets typically contain large number of columns but small number of rows. Association rules have been proved to be useful in analyzing such datasets. However, most e...
Gao Cong, Anthony K. H. Tung, Xin Xu, Feng Pan, Ji...
AAI
2010
200views more  AAI 2010»
15 years 2 months ago
An Interactive Model for Steering Behaviors of Groups of Characters
This paper presents an approach for generating steering behaviors of groups of characters based on the space colonization algorithm, that has been used in the past for generating l...
Rafael Araújo Rodrigues, Alessandro de Lima...
VTC
2006
IEEE
104views Communications» more  VTC 2006»
15 years 9 months ago
Low-Complexity Optimal Detection for Hybrid Space-Time Block Coding and Spatial Multiplexing
— The combination of space-time block codes (STBC) and spatial multiplexing (SM) schemes has the advantages of diversity gain and high data rate. For such STBC/SM hybrid systems,...
Yue Wu, Chintha Tellambura