Sciweavers

271 search results - page 21 / 55
» Procedural Urban Modeling in Practice
Sort
View
SIGGRAPH
1996
ACM
14 years 2 months ago
Progressive Meshes
Highly detailed geometric models are rapidly becoming commonplace in computer graphics. These models, often represented as complex triangle meshes, challenge rendering performance...
Hugues Hoppe
GECCO
2008
Springer
147views Optimization» more  GECCO 2008»
13 years 11 months ago
On selecting the best individual in noisy environments
In evolutionary algorithms, the typical post-processing phase involves selection of the best-of-run individual, which becomes the final outcome of the evolutionary run. Trivial f...
Wojciech Jaskowski, Wojciech Kotlowski
CGF
2010
171views more  CGF 2010»
13 years 6 months ago
Efficient Mean-shift Clustering Using Gaussian KD-Tree
Mean shift is a popular approach for data clustering, however, the high computational complexity of the mean shift procedure limits its practical applications in high dimensional ...
Chunxia Xiao, Meng Liu
ICCV
2011
IEEE
12 years 9 months ago
Perturb-and-MAP Random Fields: Using Discrete Optimization\\to Learn and Sample from Energy Models
We propose a novel way to induce a random field from an energy function on discrete labels. It amounts to locally injecting noise to the energy potentials, followed by finding t...
George Papandreou, Alan L. Yuille
CONCUR
2005
Springer
14 years 3 months ago
Constraint Solving for Contract-Signing Protocols
Research on the automatic analysis of cryptographic protocols has so far mainly concentrated on reachability properties, such as secrecy and authentication. Only recently it was sh...
Detlef Kähler, Ralf Küsters