Sciweavers

10988 search results - page 1738 / 2198
» Algorithmic Folding Complexity
Sort
View
GECCO
2010
Springer
187views Optimization» more  GECCO 2010»
15 years 11 months ago
The maximum hypervolume set yields near-optimal approximation
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...
Karl Bringmann, Tobias Friedrich
COLCOM
2009
IEEE
15 years 11 months ago
An analytical study of GWAP-based geospatial tagging systems
—Geospatial tagging (geotagging) is an emerging and very promising application that can help users find a wide variety of location-specific information, and facilitate the deve...
Ling-Jyh Chen, Yu-Song Syu, Bo-Chun Wang, Wang-Chi...
GECCO
2009
Springer
258views Optimization» more  GECCO 2009»
15 years 11 months ago
Evolutionary learning of local descriptor operators for object recognition
Nowadays, object recognition is widely studied under the paradigm of matching local features. This work describes a genetic programming methodology that synthesizes mathematical e...
Cynthia B. Pérez, Gustavo Olague
SIGGRAPH
2010
ACM
15 years 10 months ago
Interactive hair rendering under environment lighting
We present an algorithm for interactive hair rendering with both single and multiple scattering effects under complex environment lighting. The outgoing radiance due to single sca...
Zhong Ren, Kun Zhou, Tengfei Li, Wei Hua, Baining ...
FOCS
2000
IEEE
15 years 10 months ago
Extracting Randomness from Samplable Distributions
Randomness extractors convert weak sources of randomness into an almost uniform distribution; the conversion uses a small amount of pure randomness. In algorithmic applications, t...
Luca Trevisan, Salil P. Vadhan
« Prev « First page 1738 / 2198 Last » Next »