328 search results - page 23 / 66 » Simple Termination Revisited |
SIGKDD
2000
14 years 11 months ago
2000
This paper presents a simple new algorithm that performs k-means clustering in one scan of a dataset, while using a bu er for points from the dataset of xed size. Experiments show...
CORR
1999
Springer
14 years 11 months ago
1999
Springer
Most debuggers are notoriously machine-dependent, but some recent research prototypes achieve varying degrees of machine-independence with novel designs. Cdb, a simple source-leve...
ICALP
2009
Springer
16 years 3 days ago
2009
Springer
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
105
click to vote
IMC
2010
ACM
14 years 9 months ago
2010
ACM
Network management applications require accurate estimates of a wide range of flow-level traffic metrics. Given the inadequacy of current packet-sampling-based solutions, several ...
ESOP
2000
Springer
15 years 3 months ago
2000
Springer
Abstract. The basic idea behind improving the quality of a monovariant control flow analysis such as 0CFA is the concept of polyvariant analyses such as Agesen's Cartesian Pro...