Sciweavers

4315 search results - page 121 / 863
» Sorting in linear time
Sort
View
DAGSTUHL
2007
13 years 10 months ago
Diagonal Circuit Identity Testing and Lower Bounds
In this paper we give the first deterministic polynomial time algorithm for testing whether a diagonal depth-3 circuit C(x1, . . . , xn) (i.e. C is a sum of powers of linear funct...
Nitin Saxena
ACTA
2006
154views more  ACTA 2006»
13 years 9 months ago
Solving HPP and SAT by P Systems with Active Membranes and Separation Rules
The P systems (or membrane systems) are a class of distributed parallel computing devices of a biochemical type, where membrane division is the frequently investigated way for obta...
Linqiang Pan, Artiom Alhazov
IJON
2008
128views more  IJON 2008»
13 years 9 months ago
Independent arrays or independent time courses for gene expression time series data analysis
In this paper we apply three different independent component analysis (ICA) methods, including spatial ICA (sICA), temporal ICA (tICA), and spatiotemporal ICA (stICA), to gene exp...
Sookjeong Kim, Jong Kyoung Kim, Seungjin Choi
CORR
2007
Springer
154views Education» more  CORR 2007»
13 years 9 months ago
To Code or Not to Code Across Time: Space-Time Coding with Feedback
Abstract— Space-time codes leverage the availability of multiple antennas to enhance the reliability of communication over wireless channels. While space-time codes have initiall...
Che Lin, Vasanthan Raghavan, Venugopal V. Veeraval...
TCS
2008
13 years 9 months ago
Comparing evolutionary algorithms to the (1+1)-EA
In this paper, we study the conditions in which the (1+1)-EA compares favorably to other evolutionary algorithms (EAs) in terms of fitness function distribution at given iteration...
Pavel A. Borisovsky, Anton V. Eremeev