Sciweavers

1285 search results - page 8 / 257
» On the Complexity of Ordinal Clustering
Sort
View
ICONIP
2008
13 years 9 months ago
Comparison of Cluster Algorithms for the Analysis of Text Data Using Kolmogorov Complexity
In this paper we present a comparison of multiple cluster algorithms and their suitability for clustering text data. The clustering is based on similarities only, employing the Kol...
Tina Geweniger, Frank-Michael Schleif, Alexander H...
ICCV
2011
IEEE
12 years 7 months ago
Local Intensity Order Pattern for Feature Description
This paper presents a novel method for feature description based on intensity order. Specifically, a Local Intensity Order Pattern(LIOP) is proposed to encode the local ordinal i...
Zhenhua Wang, Bin Fan, Fuchao Wu
IPL
2006
93views more  IPL 2006»
13 years 7 months ago
A decidable characterization of the classes between lintime and exptime
A language is defined by closure under safe iteration and under a new form of safe diagonalization that, unlike other forms of diagonalization used in literature to define sub-recu...
Salvatore Caporaso
COMPLEXITY
2007
90views more  COMPLEXITY 2007»
13 years 7 months ago
Prisoner's dilemma and clusters on small-world networks
Xavier Thibert-Plante, Lael Parrott
IJBRA
2007
88views more  IJBRA 2007»
13 years 7 months ago
Finding molecular complexes through multiple layer clustering of protein interaction networks
: Clustering protein-protein interaction networks (PINs) helps to identify complexes that guide the cell machinery. Clustering algorithms often create a flat clustering, without co...
Bill Andreopoulos, Aijun An, Xiangji Huang, Xiaoga...