Sciweavers

392 search results - page 67 / 79
» Reversal Complexity Revisited
Sort
View
UAI
2004
13 years 10 months ago
An Empirical Evaluation of Possible Variations of Lazy Propagation
As real-world Bayesian networks continue to grow larger and more complex, it is important to investigate the possibilities for improving the performance of existing algorithms of ...
Andres Madsen
CCCG
2009
13 years 9 months ago
Enumeration of Polyominoes for p4 Tiling
Polyominoes are the two dimensional shapes made by connecting n unit squares, joined along their edges. In this paper, we propose algorithms to enumerate polyominoes for p4 tiling...
Takashi Horiyama, Masato Samejima
BMCBI
2008
57views more  BMCBI 2008»
13 years 8 months ago
A novel method for high accuracy sumoylation site prediction from protein sequences
Background: Protein sumoylation is an essential dynamic, reversible post translational modification that plays a role in dozens of cellular activities, especially the regulation o...
Jialin Xu, Yun He, Boqin Qiang, Jiangang Yuan, Xia...
CORR
2010
Springer
66views Education» more  CORR 2010»
13 years 8 months ago
Efficient Dealiased Convolutions without Padding
Algorithms are developed for calculating dealiased linear convolution sums without the expense of conventional zero-padding or phase-shift techniques. For one-dimensional in-place ...
John C. Bowman, Malcolm Roberts
ASE
1998
81views more  ASE 1998»
13 years 8 months ago
Program Understanding as Constraint Satisfaction: Representation and Reasoning Techniques
The process of understanding a source code in a high-level programming language involves complex computation. Given a piece of legacy code and a library of program plan templates, ...
Steven G. Woods, Qiang Yang