Sciweavers

70 search results - page 6 / 14
» Improving locality of nonserial polyadic dynamic programming
Sort
View
SPAA
2012
ACM
13 years 10 hour ago
Memory-mapping support for reducer hyperobjects
hyperobjects (reducers) provide a linguistic abstraction for dynamic multithreading that allows different branches of a parallel program to maintain coordinated local views of the...
I.-Ting Angelina Lee, Aamir Shafi, Charles E. Leis...
ICTAI
2002
IEEE
15 years 2 months ago
Calculus of Variations in Discrete Space for Constrained Nonlinear Dynamic Optimization
In this paper, we propose new dominance relations that can speed up significantly the solution process of nonlinear constrained dynamic optimization problems in discrete time and...
Yixin Chen, Benjamin W. Wah
ISAAC
2004
Springer
125views Algorithms» more  ISAAC 2004»
15 years 3 months ago
Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs
RNA molecules whose secondary structures contain similar substructures often have similar functions. Therefore, an important task in the study of RNA is to develop methods for disc...
Jesper Jansson, Ngo Trung Hieu, Wing-Kin Sung
BMEI
2008
IEEE
15 years 4 months ago
Adaptive Gene Expression Programming Algorithm Based on Cloud Model
Standard Gene Expression Programming(GEP) works with fixed rate of mutation and crossover, ignoring the variation of the individual fitness, hence it works in the local optimum st...
Yue Jiang, Chang-jie Tang, Haichun Zheng, Chuan Li...
81
Voted
CVPR
2005
IEEE
15 years 11 months ago
Shape Regularized Active Contour Using Iterative Global Search and Local Optimization
Recently, nonlinear shape models have been shown to improve the robustness and flexibility of segmentation. In this paper, we propose Shape Regularized Active Contour (ShRAC) that...
Tianli Yu, Jiebo Luo, Narendra Ahuja