2413 search results - page 107 / 483 » Understanding the problem |
104
click to vote
NIPS
2000
15 years 18 days ago
2000
We describe a unified framework for the understanding of structure representation in primate vision. A model derived from this framework is shown to be effectively systematic in t...
105
click to vote
CADE
2010
Springer
15 years 11 days ago
2010
Springer
Abstract. Automated theorem provers (ATPs) struggle to solve problems with large sets of possibly superfluous axiom. Several algorithms have been developed to reduce the number of ...
FMSD
1998
14 years 11 months ago
1998
The bitstate hashing, or supertrace, technique was introduced in 1987 as a method to increase the quality of verification by reachability analyses for applications that defeat anal...
104
click to vote
GECCO
2009
Springer
14 years 9 months ago
2009
Springer
We deepen the theoretical analysis of the genetic algorithm for the all-pairs shortest path problem proposed by Doerr, Happ and Klein (GECCO 2008). We show that the growth of the ...
ICMCS
2009
IEEE
14 years 9 months ago
2009
IEEE
In this paper, we tackle the problem of learning a user's interest from his photo collections and suggesting relevant ads. We address two key challenges in this work: 1) unde...