Sciweavers

1052 search results - page 156 / 211
» Mean-Variance Analysis of the Performance of Spatial Orderin...
Sort
View
ICALP
1993
Springer
14 years 1 months ago
Exact Asymptotics of Divide-and-Conquer Recurrences
The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used i...
Philippe Flajolet, Mordecai J. Golin
SERA
2010
Springer
13 years 7 months ago
Representing Unique Stakeholder Perspectives in BPM Notations
—Evidence shows that proposals for new modeling notations emerge and evolution of current ones are becoming more complex, often in an attempt to satisfy the many different modeli...
Carlos Monsalve, Alain April, Alain Abran
RECOMB
2009
Springer
14 years 9 months ago
COE: A General Approach for Efficient Genome-Wide Two-Locus Epistasis Test in Disease Association Study
The availability of high density single nucleotide polymorphisms (SNPs) data has made genome-wide association study computationally challenging. Twolocus epistasis (gene-gene inter...
Xiang Zhang, Feng Pan, Yuying Xie, Fei Zou, Wei Wa...
TNN
2008
128views more  TNN 2008»
13 years 9 months ago
Nonnegative Matrix Factorization in Polynomial Feature Space
Abstract--Plenty of methods have been proposed in order to discover latent variables (features) in data sets. Such approaches include the principal component analysis (PCA), indepe...
Ioan Buciu, Nikos Nikolaidis, Ioannis Pitas
JCST
2010
189views more  JCST 2010»
13 years 3 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar