Sciweavers

7065 search results - page 1212 / 1413
» Iterative Scheduling Algorithms
Sort
View
KDD
2003
ACM
160views Data Mining» more  KDD 2003»
16 years 6 months ago
Playing hide-and-seek with correlations
We present a method for very high-dimensional correlation analysis. The method relies equally on rigorous search strategies and on human interaction. At each step, the method cons...
Chris Jermaine
VLDB
2007
ACM
179views Database» more  VLDB 2007»
16 years 6 months ago
Mining Approximate Top-K Subspace Anomalies in Multi-Dimensional Time-Series Data
Market analysis is a representative data analysis process with many applications. In such an analysis, critical numerical measures, such as profit and sales, fluctuate over time a...
Xiaolei Li, Jiawei Han
MOBISYS
2007
ACM
16 years 5 months ago
Participatory user centered design techniques for a large scale ad-hoc health information system
During mass casualty incidents, an enormous amount of data, including the vital signs of the patients, the location of the patients, and the location of the first responders must ...
Tia Gao, Tammara Massey, Majid Sarrafzadeh, Leo Se...
PLDI
2010
ACM
16 years 3 months ago
The Reachability-Bound Problem
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
Sumit Gulwani, Florian Zuleger
SDM
2009
SIAM
193views Data Mining» more  SDM 2009»
16 years 3 months ago
Agglomerative Mean-Shift Clustering via Query Set Compression.
Mean-Shift (MS) is a powerful non-parametric clustering method. Although good accuracy can be achieved, its computational cost is particularly expensive even on moderate data sets...
Xiaotong Yuan, Bao-Gang Hu, Ran He
« Prev « First page 1212 / 1413 Last » Next »