Sciweavers

1285 search results - page 154 / 257
» On the Complexity of Ordinal Clustering
Sort
View
CSC
2009
13 years 11 months ago
Fast Monte Carlo Algorithms on Re-Wired Small-World Spin Models
Small-world networks have become an important model for understanding many complex phenomena in science and in sociological contexts. One tool for exploring the critical and phase...
Kenneth A. Hawick
CLUSTER
2007
IEEE
13 years 10 months ago
Combining data sharing with the master-worker paradigm in the common component architecture
Abstract— Software component technologies are being accepted as an adequate solution for handling the complexity of applications. However, existing software component models tend...
Gabriel Antoniu, Hinde-Lilia Bouziane, Mathieu Jan...
DKE
2007
105views more  DKE 2007»
13 years 10 months ago
On compressing frequent patterns
A major challenge in frequent-pattern mining is the sheer size of its mining results. To compress the frequent patterns, we propose to cluster frequent patterns with a tightness m...
Dong Xin, Jiawei Han, Xifeng Yan, Hong Cheng
ACTA
2005
104views more  ACTA 2005»
13 years 10 months ago
Optimal recovery schemes in fault tolerant distributed computing
Clusters and distributed systems offer fault tolerance and high performance through load sharing. When all n computers are up and running, we would like the load to be evenly distr...
Kamilla Klonowska, Håkan Lennerstad, Lars Lu...
TIP
2008
261views more  TIP 2008»
13 years 10 months ago
CTex - An Adaptive Unsupervised Segmentation Algorithm Based on Color-Texture Coherence
Abstract--This paper presents the development of an unsupervised image segmentation framework (referred to as CTex) that is based on the adaptive inclusion of color and texture in ...
Dana Elena Ilea, Paul F. Whelan