A Time-Predefined Approach to Course Timetabling
Edmund Burke, Yuri Bykov, James Newall, Sanja Petrović (2003)
The Yugoslav Journal of Operations Research
Similarity:
Edmund Burke, Yuri Bykov, James Newall, Sanja Petrović (2003)
The Yugoslav Journal of Operations Research
Similarity:
Aleksandar B. Samardžić, Dušan Starčević, Milan Tuba (2006)
The Yugoslav Journal of Operations Research
Similarity:
Ye Tao, Xueqing Li, Bian Wu (2010)
Computer Science and Information Systems
Similarity:
Khalid Saeed, Marek Tabędzki, Mariusz Rybnik, Marcin Adamski (2010)
International Journal of Applied Mathematics and Computer Science
Similarity:
This paper aims at three aspects closely related to each other: first, it presents the state of the art in the area of thinning methodologies, by giving descriptions of general ideas of the most significant algorithms with a comparison between them. Secondly, it proposes a new thinning algorithm that presents interesting properties in terms of processing quality and algorithm clarity, enriched with examples. Thirdly, the work considers parallelization issues for intrinsically sequential...
Thomas Berry, Somasundaram Ravindran (2002)
Kybernetika
Similarity:
In this paper we present experimental results for string matching algorithms which have a competitive theoretical worst case run time complexity. Of these algorithms a few are already famous for their speed in practice, such as the Boyer–Moore and its derivatives. We chose to evaluate the algorithms by counting the number of comparisons made and by timing how long they took to complete a given search. Using the experimental results we were able to introduce a new string matching algorithm...
Ireneusz Czarnowski, Piotr Jędrzejowicz (2011)
International Journal of Applied Mathematics and Computer Science
Similarity:
The problem considered concerns data reduction for machine learning. Data reduction aims at deciding which features and instances from the training set should be retained for further use during the learning process. Data reduction results in increased capabilities and generalization properties of the learning model and a shorter time of the learning process. It can also help in scaling up to large data sources. The paper proposes an agent-based data reduction approach with the learning...
Liming Yuan, Jiafeng Liu, Xianglong Tang (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Multiple-Instance Learning (MIL) has attracted much attention of the machine learning community in recent years and many real-world applications have been successfully formulated as MIL problems. Over the past few years, several Instance Selection-based MIL (ISMIL) algorithms have been presented by using the concept of the embedding space. Although they delivered very promising performance, they often require long computation times for instance selection, leading to a low efficiency...
Zengyou He, Xiaofei Xu, Shenchun Deng (2006)
Computer Science and Information Systems
Similarity:
Marek Tabedzki, Khalid Saeed, Adam Szczepański (2016)
International Journal of Applied Mathematics and Computer Science
Similarity:
The K3M thinning algorithm is a general method for image data reduction by skeletonization. It had proved its feasibility in most cases as a reliable and robust solution in typical applications of thinning, particularly in preprocessing for optical character recognition. However, the algorithm had still some weak points. Since then K3M has been revised, addressing the best known drawbacks. This paper presents a modified version of the algorithm. A comparison is made with the original...
Vladimir Jovičić, Zora Konjović (1997)
The Yugoslav Journal of Operations Research
Similarity:
Nedeljko Ostojić, Dušan Starčević (2000)
The Yugoslav Journal of Operations Research
Similarity:
Dragan Matić (2010)
The Yugoslav Journal of Operations Research
Similarity:
Marinov, Alexander, Zlateva, Nadezhda, Dimov, Dimo, Marinov, Delian (2012)
Serdica Journal of Computing
Similarity:
ACM Computing Classification System (1998): I.2.8, I.2.10, I.5.1, J.2. Given the coarse celestial coordinates of the centre of a plate scan and the field of view, we are looking for a mapping between the stars extracted from the image and the stars from a catalogue, where the stars from both sources are represented by their stellar magnitudes and coordinates, relatively to the image centre. In a previous work we demonstrated the application of Iterative Closest Point (ICP)...