Sciweavers

25 search results - page 1 / 5
» Distance- k knowledge in self-stabilizing algorithms
Sort
View
TCS
2008
13 years 4 months ago
Distance- k knowledge in self-stabilizing algorithms
Abstract. Many graph problems seem to require knowledge that extends beyond the immediate neighbors of a node. The usual self-stabilizing model only allows for nodes to make decisi...
Wayne Goddard, Stephen T. Hedetniemi, David Pokras...
DEXA
2003
Springer
193views Database» more  DEXA 2003»
13 years 10 months ago
Supporting KDD Applications by the k-Nearest Neighbor Join
Abstract. The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such t...
Christian Böhm, Florian Krebs
IWCIA
2004
Springer
13 years 10 months ago
Corner Detection and Curve Partitioning Using Arc-Chord Distance
Abstract. Several authors have proposed algorithms for curve partitioning using the arc-chord distance formulation, where a chord whose associated arc spans k pixels is moved along...
Majed Marji, Reinhard Klette, Pepe Siy
SSDBM
2005
IEEE
218views Database» more  SSDBM 2005»
13 years 10 months ago
The "Best K" for Entropy-based Categorical Data Clustering
With the growing demand on cluster analysis for categorical data, a handful of categorical clustering algorithms have been developed. Surprisingly, to our knowledge, none has sati...
Keke Chen, Ling Liu
VLDB
1998
ACM
192views Database» more  VLDB 1998»
13 years 9 months ago
Algorithms for Mining Distance-Based Outliers in Large Datasets
This paper deals with finding outliers (exceptions) in large, multidimensional datasets. The identification of outliers can lead to the discovery of truly unexpected knowledge in ...
Edwin M. Knorr, Raymond T. Ng