Sciweavers

2926 search results - page 206 / 586
» Computer graphics identification using genetic algorithm
Sort
View
142
Voted
GECCO
2008
Springer
232views Optimization» more  GECCO 2008»
15 years 4 months ago
An efficient SVM-GA feature selection model for large healthcare databases
This paper presents an efficient hybrid feature selection model based on Support Vector Machine (SVM) and Genetic Algorithm (GA) for large healthcare databases. Even though SVM an...
Rick Chow, Wei Zhong, Michael Blackmon, Richard St...
149
Voted
CORR
2011
Springer
206views Education» more  CORR 2011»
14 years 10 months ago
Arrangement Computation for Planar Algebraic Curves
We present a new certified and complete algorithm to compute arrangements of real planar algebraic curves. Our algorithm provides a geometric-topological analysis of the decompos...
Eric Berberich, Pavel Emeliyanenko, Alexander Kobe...
134
Voted
CGI
1998
IEEE
15 years 7 months ago
Hierarchical Visibility Culling with Occlusion Trees
In the scope of rendering complex models with high depth complexity, it is of great importance to design outputsensitive algorithms, i.e., algorithms with the time complexity prop...
Jirí Bittner, Vlastimil Havran, Pavel Slav&...
98
Voted
SIGGRAPH
1991
ACM
15 years 7 months ago
Spectrally optimal sampling for distribution ray tracing
Nonuniform sampling of images is a useful technique in computer graphics, because a properly designed pattern of samples can make aliasing take the form of high-frequency random n...
Don P. Mitchell
COMPGEOM
2004
ACM
15 years 7 months ago
Complete, exact, and efficient computations with cubic curves
The Bentley-Ottmann sweep-line method can be used to compute the arrangement of planar curves provided a number of geometric primitives operating on the curves are available. We d...
Arno Eigenwillig, Lutz Kettner, Elmar Schömer...