1532 search results - page 100 / 307 » The Symbol Grounding Problem |
135
click to vote
CIE
2008
Springer
15 years 6 months ago
2008
Springer
Consider the problem of calculating the fractal dimension of a set X consisting of all infinite sequences S over a finite alphabet that satisfy some given condition P on the asympt...
160
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
A well studied special case of bin packing is the 3-partition problem, where n items of size > 1 4 have to be packed in a minimum number of bins of capacity one. The famous Kar...
152
click to vote
AI
2000
Springer
15 years 4 months ago
2000
Springer
We propose a framework for the representation of visual knowledge in a robotic agent, with special attention to the understanding of dynamic scenes. According to our approach, und...
132
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
This paper describes a new approximate maximum-likelihood (ML) MIMO detection approach by studying a Lagrangian dual relaxation (LDR) of ML. Unlike many existing relaxed ML method...
137
click to vote
FOCS
1991
IEEE
15 years 7 months ago
1991
IEEE
We wish to increase the power of an arbitrary algorithm designed for non-degenerate input, by allowing it to execute on all inputs. We concentrate on in nitesimal symbolic perturba...