Sciweavers

3020 search results - page 285 / 604
» Optimal partition trees
Sort
View
PAKDD
2010
ACM
134views Data Mining» more  PAKDD 2010»
15 years 8 months ago
A Robust Seedless Algorithm for Correlation Clustering
Abstract. Finding correlation clusters in the arbitrary subspaces of highdimensional data is an important and a challenging research problem. The current state-of-the-art correlati...
Mohammad S. Aziz, Chandan K. Reddy
ECIR
2007
Springer
15 years 8 months ago
A Hierarchical Consensus Architecture for Robust Document Clustering
Abstract. A major problem encountered by text clustering practitioners is the difficulty of determining a priori which is the optimal text representation and clustering technique f...
Xavier Sevillano, Germán Cobo, Francesc Al&...
TIT
2010
112views Education» more  TIT 2010»
15 years 1 months ago
Twice-universal simulation of Markov sources and individual sequences
Abstract-- The problem of universal simulation given a training sequence is studied both in a stochastic setting and for individual sequences. In the stochastic setting, the traini...
Alvaro Martín, Neri Merhav, Gadiel Seroussi...
ICC
2009
IEEE
197views Communications» more  ICC 2009»
16 years 1 months ago
A Game-Based Self-Organizing Uplink Tree for VoIP Services in IEEE 802.16j Networks
— In this paper, we propose a game theoretical approach to tackle the problem of the distributed formation of the uplink tree structure among the relay stations (RSs) and their s...
Walid Saad, Zhu Han, Mérouane Debbah, Are H...
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
15 years 8 months ago
Fast and reliable reconstruction of phylogenetic trees with very short edges
Abstract Ilan Gronau Shlomo Moran Sagi Snir Phylogenetic reconstruction is the problem of reconstructing an evolutionary tree from sequences corresponding to leaves of that tree. ...
Ilan Gronau, Shlomo Moran, Sagi Snir