7380 search results - page 284 / 1476 » time 2008 |
172
click to vote
CLEIEJ
2006
15 years 6 months ago
2006
This paper is an application of Ant Colony Metaheuristic (ACO) to the problem of image fractal compression using IFS. An ACO hybrid algorithm is proposed for image fractal compres...
147
Voted
DAM
2007
15 years 6 months ago
2007
We study a many-to-many generalisation of the well-known stable roommates problem in which each participant seeks to be matched with a number of others. We present a linear-time a...
168
click to vote
TREC
2007
15 years 7 months ago
2007
This report describes Dartmouth College’s approach and results for the 2007 TREC Legal Track. Our original plan was to use the Combination of Expert Opinion (CEO) algorithm [1],...
167
click to vote
DEDS
2006
15 years 6 months ago
2006
A class of time-varying discrete-event systems, named dynamic discrete-event systems, is defined. The goal of this paper is to provide a method which is modular and can be applied ...
155
click to vote
JCSS
2008
15 years 6 months ago
2008
The cornerstone of any algorithm computing all repetitions in strings of length n in O(n) time is the fact that the number of maximal repetitions (runs) is linear. Therefore, the ...