Sciweavers

1368 search results - page 84 / 274
» Avoiding Simplicity Is Complex
Sort
View
IMR
2003
Springer
14 years 3 months ago
Isotropic Remeshing of Surfaces: A Local Parameterization Approach
We present a method for isotropic remeshing of arbitrary genus surfaces. The method is based on a mesh adaptation process, namely, a sequence of local modifications performed on ...
Vitaly Surazhsky, Pierre Alliez, Craig Gotsman
SAC
2010
ACM
14 years 3 months ago
An algorithm to generate the context-sensitive synchronized control flow graph
The verification of industrial systems specified with CSP often implies the analysis of many concurrent and synchronized components. The cost associated to these analyses is usu...
Marisa Llorens, Javier Oliver, Josep Silva, Salvad...
PLDI
2010
ACM
14 years 3 months ago
Bamboo: a data-centric, object-oriented approach to many-core software
Traditional data-oriented programming languages such as dataflow s and stream languages provide a natural abstraction for parallel programming. In these languages, a developer fo...
Jin Zhou, Brian Demsky
COMPGEOM
2009
ACM
14 years 2 months ago
k-means requires exponentially many iterations even in the plane
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
Andrea Vattani
GECCO
2009
Springer
134views Optimization» more  GECCO 2009»
14 years 2 months ago
Estimating the distribution and propagation of genetic programming building blocks through tree compression
Shin et al [19] and McKay et al [15] previously applied tree compression and semantics-based simplification to study the distribution of building blocks in evolving Genetic Progr...
Robert I. McKay, Xuan Hoai Nguyen, James R. Cheney...