Sciweavers

876 search results - page 156 / 176
» Limits on the Usefulness of Random Oracles
Sort
View
JGS
2006
113views more  JGS 2006»
15 years 20 days ago
Pattern based map comparisons
Map comparison techniques based on a pixel-by-pixel comparison are useful for many purposes, but fail to reveal important aspects of map similarities and differences. In contrast, ...
Roger White
127
Voted
CGO
2008
IEEE
15 years 7 months ago
Cole: compiler optimization level exploration
Modern compilers implement a large number of optimizations which all interact in complex ways, and which all have a different impact on code quality, compilation time, code size,...
Kenneth Hoste, Lieven Eeckhout
129
Voted
GECCO
2004
Springer
139views Optimization» more  GECCO 2004»
15 years 6 months ago
Chemical Genetic Programming - Coevolution Between Genotypic Strings and Phenotypic Trees
Chemical Genetic Programming (CGP) is a new method of genetic programming that introduced collision-based biochemical processes and realized dynamic mapping from genotypic strings ...
Wojciech Piaseczny, Hideaki Suzuki, Hidefumi Sawai
AIPR
2002
IEEE
15 years 5 months ago
Hyperspectral Imaging of Kaposi's Sarcoma for Disease Assessment and Treatment Monitoring
Light spectroscopic methods are critical to advances in molecular characterization of disease processes. However, these methods have been limited to in-vitro or cell culture studi...
David Hattery, Moinuddin Hassan, Stavros Demos, Am...
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
15 years 2 months ago
A tight lower bound for parity in noisy communication networks
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Ja...