Sciweavers

1809 search results - page 273 / 362
» Weakly Computable Real Numbers
Sort
View
SDM
2009
SIAM
176views Data Mining» more  SDM 2009»
14 years 6 months ago
Constraint-Based Subspace Clustering.
In high dimensional data, the general performance of traditional clustering algorithms decreases. This is partly because the similarity criterion used by these algorithms becomes ...
Élisa Fromont, Adriana Prado, Céline...
EUROSYS
2009
ACM
14 years 6 months ago
Koala: a platform for OS-level power management
Managing the power consumption of computing platforms is a complicated problem thanks to a multitude of hardware configuration options and characteristics. Much of the academic r...
David C. Snowdon, Etienne Le Sueur, Stefan M. Pett...
CEC
2009
IEEE
14 years 3 months ago
A Bacterial Evolutionary Algorithm for automatic data clustering
This paper describes an evolutionary clustering algorithm, which can partition a given dataset automatically into the optimal number of groups through one shot of optimization. The...
Swagatam Das, Archana Chowdhury, Ajith Abraham
RTCSA
2009
IEEE
14 years 3 months ago
Bounding the Maximum Length of Non-preemptive Regions under Fixed Priority Scheduling
The question whether preemptive systems are better than non-preemptive systems has been debated for a long time, but only partial answers have been provided in the real-time liter...
Gang Yao, Giorgio C. Buttazzo, Marko Bertogna
ICDM
2008
IEEE
102views Data Mining» more  ICDM 2008»
14 years 3 months ago
Mining Order-Preserving Submatrices from Data with Repeated Measurements
Order-preserving submatrices (OPSM’s) have been shown useful in capturing concurrent patterns in data when the relative magnitudes of data items are more important than their ab...
Chun Kit Chui, Ben Kao, Kevin Y. Yip, Sau Dan Lee