Sciweavers

681 search results - page 67 / 137
» et 2006
Sort
View
FUIN
2006
139views more  FUIN 2006»
14 years 9 months ago
Efficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Dariusz Dereniowski, Marek Kubale
IANDC
2006
93views more  IANDC 2006»
14 years 9 months ago
Aperiodic propagation criteria for Boolean functions
We characterise the aperiodic autocorrelation for a Boolean function, f, and define the Aperiodic Propagation Criteria (APC) of degree l and order q. We establish the strong simil...
Lars Eirik Danielsen, T. Aaron Gulliver, Matthew G...
IJBRA
2006
111views more  IJBRA 2006»
14 years 9 months ago
Memory efficient alignment between RNA sequences and stochastic grammar models of pseudoknots
: Stochastic Context-Free Grammars (SCFG) has been shown to be effective in modelling RNA secondary structure for searches. Our previous work (Cai et al., 2003) in Stochastic Paral...
Yinglei Song, Chunmei Liu, Russell L. Malmberg, Co...
79
Voted
IJCGA
2006
81views more  IJCGA 2006»
14 years 9 months ago
Discrete Laplace-Beltrami Operator on Sphere and Optimal Spherical Triangulations
In this paper we first modify a widely used discrete Laplace Beltrami operator proposed by Meyer et al over triangular surfaces, and then establish some convergence results for th...
Guoliang Xu
IJDMB
2006
90views more  IJDMB 2006»
14 years 9 months ago
An efficient motif discovery algorithm with unknown motif length and number of binding sites
: Most motif discovery algorithms from DNA sequences require the motif's length as input. Styczynski et al. introduced the Extended (l,d)-Motif Problem (EMP) where the motif&#...
Henry C. M. Leung, Francis Y. L. Chin