1136 search results - page 25 / 228 » Finding Small Holes |
CIKM
2006
Springer
14 years 26 days ago
2006
Springer
We consider the problem of finding highly correlated pairs in a large data set. That is, given a threshold not too small, we wish to report all the pairs of items (or binary attri...
IPPS
1998
IEEE
14 years 1 months ago
1998
IEEE
Scheduling jobs on the IBM SP2 system is usually done by giving each job a partition of the machine for its exclusive use. Allocating such partitions in the order that the jobs ar...
CCR
2008
13 years 9 months ago
2008
Knowledge of the largest traffic flows in a network is important for many network management applications. The problem of finding these flows is known as the heavy-hitter problem ...
CORR
2011
Springer
13 years 4 months ago
2011
Springer
— this paper presents an enhancement of the medial axis algorithm to be used for finding the optimal shortest path for developed cognitive map. The cognitive map has been develop...
ICDM
2009
IEEE
14 years 3 months ago
2009
IEEE
—Time series motifs are sets of very similar subsequences of a long time series. They are of interest in their own right, and are also used as inputs in several higher-level data...