Sciweavers

1285 search results - page 95 / 257
» On the Complexity of Ordinal Clustering
Sort
View
AAAI
2011
14 years 1 months ago
Exploiting Phase Transition in Latent Networks for Clustering
In this paper, we model the pair-wise similarities of a set of documents as a weighted network with a single cutoff parameter. Such a network can be thought of an ensemble of unwe...
Vahed Qazvinian, Dragomir R. Radev
JSA
2006
82views more  JSA 2006»
15 years 1 months ago
A flocking based algorithm for document clustering analysis
ct 7 Social animals or insects in nature often exhibit a form of emergent collective behavior known as flocking. In this paper, 8 we present a novel Flocking based approach for doc...
Xiaohui Cui, Jinzhu Gao, Thomas E. Potok
DAC
2002
ACM
16 years 2 months ago
Energy estimation and optimization of embedded VLIW processors based on instruction clustering
Aim of this paper is to propose a methodology for the definition of an instruction-level energy estimation framework for VLIW (Very Long Instruction Word) processors. The power mo...
Andrea Bona, Mariagiovanna Sami, Donatella Sciuto,...
HPCA
2003
IEEE
16 years 1 months ago
Dynamic Data Replication: An Approach to Providing Fault-Tolerant Shared Memory Clusters
A challenging issue in today's server systems is to transparently deal with failures and application-imposed requirements for continuous operation. In this paper we address t...
Rosalia Christodoulopoulou, Reza Azimi, Angelos Bi...
ADBIS
2006
Springer
166views Database» more  ADBIS 2006»
15 years 7 months ago
Clustering-Based Materialized View Selection in Data Warehouses
materialized view selection is a non-trivial task. Hence, its complexity must be reduced. A judicious choice of views must be costdriven and influenced by the workload experienced...
Kamel Aouiche, Pierre-Emmanuel Jouve, Jér&o...