989 search results - page 104 / 198 » Approximating the Pareto optimal set using a reduced set of ... |
COMPGEOM
2003
ACM
14 years 1 months ago
2003
ACM
We introduce billboard clouds – a new approach for extreme simplification in the context of real-time rendering. 3D models are simplified onto a set of planes with texture and...
AAAI
2007
13 years 10 months ago
2007
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
CVPR
2010
IEEE
13 years 8 months ago
2010
IEEE
We propose a new algorithm for learning kernels for variants of the Normalized Cuts (NCuts) objective – i.e., given a set of training examples with known partitions, how should ...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
Learning to rank is a new statistical learning technology on creating a ranking model for sorting objects. The technology has been successfully applied to web search, and is becom...
GECCO
2003
Springer
14 years 1 months ago
2003
Springer
This paper suggests dense and switched modular primitives for a bond-graph-based GP design framework that automatically synthesizes designs for multi-domain, lumped parameter dynam...