Sciweavers

1272 search results - page 140 / 255
» The Set Cover with Pairs Problem
Sort
View
KDD
2007
ACM
176views Data Mining» more  KDD 2007»
14 years 11 months ago
Mining correlated bursty topic patterns from coordinated text streams
Previous work on text mining has almost exclusively focused on a single stream. However, we often have available multiple text streams indexed by the same set of time points (call...
Xuanhui Wang, ChengXiang Zhai, Xiao Hu, Richard Sp...
ICCCN
2008
IEEE
14 years 5 months ago
p-Percent Coverage Schedule in Wireless Sensor Networks
—We investigate the p-percent coverage problem in this paper and propose two algorithms to prolong network lifetime based on the fact that for some applications full coverage is ...
Shan Gao, Xiaoming Wang, Yingshu Li
ICST
2008
IEEE
14 years 5 months ago
Efficient Test Data Generation for Variables with Complex Dependencies
This paper introduces a new method for generating test data that combines the benefits of equivalence partitioning, boundary value analysis and cause-effect analysis. It is suitab...
Armin Beer, Stefan Mohacsi
GECCO
2003
Springer
113views Optimization» more  GECCO 2003»
14 years 4 months ago
The Effect of Binary Matching Rules in Negative Selection
Negative selection algorithm is one of the most widely used techniques in the field of artificial immune systems. It is primarily used to detect changes in data/behavior patterns...
Fabio A. González, Dipankar Dasgupta, Jonat...
ECAI
2004
Springer
14 years 2 months ago
Instance-Based Prediction with Guaranteed Confidence
Instance-based learning (IBL) algorithms have proved to be successful in many applications. However, as opposed to standard statistical methods, a prediction in IBL is usually give...
Eyke Hüllermeier