Sciweavers

410 search results - page 50 / 82
» Max and min limiters
Sort
View
CLEF
2010
Springer
13 years 8 months ago
CoReMo System (Contextual Reference Monotony) - Lab Report for PAN at CLEF 2010
In this paper a new approach is shown for a very fast monolingual external plagiarism detection system based on an altered n-gram concept (contextual n-gram), a new high precision ...
Diego Antonio Rodríguez Torrejón, Jo...
IPPS
2005
IEEE
14 years 1 months ago
Security-Driven Heuristics and A Fast Genetic Algorithm for Trusted Grid Job Scheduling
In this paper, our contributions are two-fold: First, we enhance the Min-Min and Sufferage heuristics under three risk modes driven by security concerns. Second, we propose a new ...
Shanshan Song, Yu-Kwong Kwok, Kai Hwang
ATMOS
2010
308views Optimization» more  ATMOS 2010»
13 years 6 months ago
The Team Orienteering Problem: Formulations and Branch-Cut and Price
The Team Orienteering Problem is a routing problem on a graph with durations associated to the arcs and profits assigned to visiting the vertices. A fixed number of identical ve...
Marcus Poggi de Aragão, Henrique Viana, Edu...
ICC
2008
IEEE
110views Communications» more  ICC 2008»
14 years 2 months ago
Antenna Selection for Next Generation IEEE 802.16 Mobile Stations
The IEEE 802.16/WiMAX standard has fully embraced multi-antenna technology and can, thus, deliver robust and high transmission rates and higher system capacity. Nevertheless, due ...
Chun Nie, Zhifeng Tao, Neelesh B. Mehta, Andreas F...
JCST
2008
119views more  JCST 2008»
13 years 7 months ago
Mining Frequent Generalized Itemsets and Generalized Association Rules Without Redundancy
This paper presents some new algorithms to efficiently mine max frequent generalized itemsets (g-itemsets) and essential generalized association rules (g-rules). These are compact ...
Daniel Kunkle, Donghui Zhang, Gene Cooperman