Sciweavers

4860 search results - page 661 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
WSCG
2004
120views more  WSCG 2004»
15 years 8 months ago
Voxelization of Solids Using Simplicial Coverings
Rasterization of polygons in 2D is a well known problem, existing several optimal solutions to solve it. The extension of this problem to 3D is more difficult and most existing so...
Antonio J. Rueda Ruiz, Rafael Jesús Segura,...
CEC
2007
IEEE
15 years 6 months ago
Entropy-based Memetic Particle Swarm Optimization for computing periodic orbits of nonlinear mappings
— The computation of periodic orbits of nonlinear mappings is very important for studying and better understanding the dynamics of complex systems. Evolutionary algorithms have s...
Y. G. Petalas, Konstantinos E. Parsopoulos, Michae...
ESWA
2006
103views more  ESWA 2006»
15 years 6 months ago
Model gene network by semi-fixed Bayesian network
Gene networks describe functional pathways in a given cell or tissue, representing processes such as metabolism, gene expression regulation, and protein or RNA transport. Thus, le...
Tie-Fei Liu, Wing-Kin Sung, Ankush Mittal
CORR
2007
Springer
167views Education» more  CORR 2007»
15 years 6 months ago
Optimal Solutions for Sparse Principal Component Analysis
Given a sample covariance matrix, we examine the problem of maximizing the variance explained by a linear combination of the input variables while constraining the number of nonze...
Alexandre d'Aspremont, Francis R. Bach, Laurent El...
JGTOOLS
2008
137views more  JGTOOLS 2008»
15 years 6 months ago
Robust Soft Shadow Mapping with Backprojection and Depth Peeling
Abstract. Soft shadow mapping is an attractive solution to the problem of realtime soft shadows because it works with any kind of rasterizable geometry (in particular alpha-transpa...
Louis Bavoil, Steven P. Callahan, Cláudio T...