Sciweavers

6943 search results - page 1321 / 1389
» Representations for evolutionary algorithms
Sort
View
COMPGEOM
2006
ACM
15 years 9 months ago
Provably good sampling and meshing of Lipschitz surfaces
In the last decade, a great deal of work has been devoted to the elaboration of a sampling theory for smooth surfaces. The goal was to ensure a good reconstruction of a given surf...
Jean-Daniel Boissonnat, Steve Oudot
SAC
2006
ACM
15 years 9 months ago
The impact of sample reduction on PCA-based feature extraction for supervised learning
“The curse of dimensionality” is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity and classification error in high dimension...
Mykola Pechenizkiy, Seppo Puuronen, Alexey Tsymbal
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
15 years 9 months ago
The computational complexity of nash equilibria in concisely represented games
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
Grant Schoenebeck, Salil P. Vadhan
VISUALIZATION
2005
IEEE
15 years 9 months ago
Topology-driven Surface Mappings with Robust Feature Alignment
Topological concepts and techniques have been broadly applied in computer graphics and geometric modeling. However, the homotopy type of a mapping between two surfaces has not bee...
Christopher Carner, Miao Jin, Xianfeng Gu, Hong Qi...
VISUALIZATION
2005
IEEE
15 years 9 months ago
Streaming Meshes
Recent years have seen an immense increase in the complexity of geometric data sets. Today’s gigabyte-sized polygon models can no longer be completely loaded into the main memor...
Martin Isenburg, Peter Lindstrom
« Prev « First page 1321 / 1389 Last » Next »