3250 search results - page 225 / 650 » Parameterized Learning Complexity |
177
click to vote
COCO
2006
Springer
15 years 10 months ago
2006
Springer
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
177
click to vote
ECAL
1999
Springer
15 years 10 months ago
1999
Springer
We report on a case study in the emergence of a lexicon in a group of autonomous distributed agents situated and grounded in an open environment. Because the agents are autonomous,...
169
click to vote
IJCAI
1989
15 years 7 months ago
1989
Each concept description language and search strategy has an inherent inductive bias, a preference for some hypotheses over others. No single inductive bias performs optimally on ...
160
click to vote
JUCS
2008
15 years 6 months ago
2008
: This paper analyses aspects about the recommendation process in distributed information systems. It extracts similarities and differences between recommendations in estores and t...
181
click to vote
ICONIP
2009
15 years 4 months ago
2009
In this paper, we introduce a novel incremental subspace based object tracking algorithm. The two major contributions of our work are the Robust PCA based occlusion handling scheme...