807 search results - page 21 / 162 » Competition Adds Complexity |
86
Voted
IWANN
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. The aim of this paper is to present a new tool of multiple instance learning which is designed using a grammar based genetic programming (GGP) algorithm. We study its app...
93
Voted
CSC
2009
14 years 10 months ago
2009
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
77
Voted
CLEF
2006
Springer
15 years 1 months ago
2006
Springer
This paper presents Wolverhampton University's participation in the WiQA competition. The method chosen for this task combines a high precision, but low recall information re...
ICIP
2002
IEEE
15 years 11 months ago
2002
IEEE
We propose a new, very low complexity, single-pass, algorithm for compression of continuous tone compound documents, known as GRAFIT (GuaRAnteed FIT) that can guarantee a minimum ...
86
Voted
IJCNN
2000
IEEE
15 years 2 months ago
2000
IEEE
A self-organizing neural network for learning and recall of complex temporal sequences is proposed. we consider a single sequence with repeated items, or several sequences with a c...