Sciweavers

8431 search results - page 224 / 1687
» Algorithmically Independent Sequences
Sort
View
SODA
2008
ACM
82views Algorithms» more  SODA 2008»
15 years 7 months ago
On properties of random dissections and triangulations
In the past decades the Gn,p model of random graphs, introduced by Erdos and R
Nicla Bernasconi, Konstantinos Panagiotou, Angelik...
CCECE
2006
IEEE
16 years 14 days ago
Survey of Biological High Performance Computing: Algorithms, Implementations and Outlook Research
During recent years there has been an explosive growth of biological data coming from genome projects, proteomics, protein structure determination, and the rapid expansion in digi...
Nasreddine Hireche, J. M. Pierre Langlois, Gabriel...
CPM
2004
Springer
94views Combinatorics» more  CPM 2004»
15 years 11 months ago
Sorting by Length-Weighted Reversals: Dealing with Signs and Circularity
Abstract. We consider the problem of sorting linear and circular permutations and 0/1 sequences by reversals in a length-sensitive cost model. We extend the results on sorting by l...
Firas Swidan, Michael A. Bender, Dongdong Ge, Sima...
ISCAS
2005
IEEE
131views Hardware» more  ISCAS 2005»
15 years 12 months ago
Blind signal separation into groups of dependent signals using joint block diagonalization
— Multidimensional or group independent component analysis describes the task of transforming a multivariate observed sensor signal such that groups of the transformed signal com...
Fabian J. Theis
ICA
2010
Springer
15 years 7 months ago
Adaptive Underdetermined ICA for Handling an Unknown Number of Sources
Independent Component Analysis is the best known method for solving blind source separation problems. In general, the number of sources must be known in advance. In many cases, pre...
Andreas Sandmair, Alam Zaib, Fernando Puente Le&oa...