1414 search results - page 174 / 283 » Randomness and Universal Machines |
116
Voted
IJCAI
1993
15 years 4 months ago
1993
Since its inception, arti cial intelligence has relied upon a theoretical foundation centred around perfect rationality as the desired property of intelligent systems. We argue, a...
137
Voted
PPSC
1993
15 years 4 months ago
1993
The dense nonsymmetric eigenproblem is one of the hardest linear algebra problems to solvee ectively on massivelyparallel machines. Rather than trying to design a black box" ...
125
click to vote
MANSCI
2007
15 years 3 months ago
2007
Extracting sentiment from text is a hard semantic problem. We develop a methodology for extracting small investor sentiment from stock message boards. The algorithm comprises di�...
171
click to vote
CIKM
2008
Springer
15 years 5 months ago
2008
Springer
Most prior work on information extraction has focused on extracting information from text in digital documents. However, often, the most important information being reported in an...
107
Voted
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
Humans and animals learn much better when the examples are not randomly presented but organized in a meaningful order which illustrates gradually more concepts, and gradually more ...