537 search results - page 107 / 108 » Problems from CGCS Luminy, May 2007 |
CC
2007
Springer
14 years 11 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
103
click to vote
CORR
2007
Springer
14 years 11 months ago
2007
Springer
This is a programmatic paper, marking out two directions in which the study of social media can contribute to broader problems of social science: understanding cultural evolution ...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
Questions of understanding and quantifying the representation and amount of information in organisms have become a central part of biological research, as they potentially hold th...
115
click to vote
CSDA
2007
14 years 11 months ago
2007
Model-based clustering exploits finite mixture models for detecting group in a data set. It provides a sound statistical framework which can address some important issues, such as...
109
click to vote
ENGL
2007
14 years 11 months ago
2007
—“A General Reflex Fuzzy Min-Max Neural Network” (GRFMN) is presented. GRFMN is capable to extract the underlying structure of the data by means of supervised, unsupervised a...