1055 search results - page 123 / 211 » Enumerations in computable structure theory |
GECCO
2007
Springer
14 years 4 months ago
2007
Springer
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...
CALCO
2005
Springer
14 years 3 months ago
2005
Springer
Scalars, Loops, and Free Traced and Strongly Compact Closed Categories Samson Abramsky Oxford University Computing Laboratory Wolfson Building, Parks Road, Oxford OX1 3QD, U.K. htt...
DAGSTUHL
2010
13 years 11 months ago
2010
Visualizations are well suited to communicate large amounts of complex data. With increasing resolution in the spatial and temporal domain simple imaging techniques meet their lim...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Many AI researchers and cognitive scientists have argued that analogy is the core of cognition. The most influential work on computational modeling of analogy-making is Structure ...
CVPR
2009
IEEE
15 years 5 months ago
2009
IEEE
Stereo matching commonly requires rectified images that
are computed from calibrated cameras. Since all under-
lying parametric camera models are only approximations,
calibratio...