Sciweavers

1093 search results - page 114 / 219
» Clustering from Constraint Graphs
Sort
View
125
Voted
ALGORITHMICA
2010
95views more  ALGORITHMICA 2010»
15 years 3 months ago
Homogeneous String Segmentation using Trees and Weighted Independent Sets
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
Peter Damaschke
WISE
2009
Springer
16 years 22 days ago
Formal Identification of Right-Grained Services for Service-Oriented Modeling
Identifying the right-grained services is important to lead the successful service orientation because it has a direct impact on two major goals: the composability of loosely-coupl...
Yukyong Kim, Kyung-Goo Doh
151
Voted
PAKDD
2010
ACM
193views Data Mining» more  PAKDD 2010»
15 years 2 months ago
As Time Goes by: Discovering Eras in Evolving Social Networks
Abstract. Within the large body of research in complex network analysis, an important topic is the temporal evolution of networks. Existing approaches aim at analyzing the evolutio...
Michele Berlingerio, Michele Coscia, Fosca Giannot...
118
Voted
ADHOCNOW
2008
Springer
15 years 4 months ago
Optimal Gathering Algorithms in Multi-hop Radio Tree-Networks ith Interferences
We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network...
Jean-Claude Bermond, Min-Li Yu
AHSWN
2010
105views more  AHSWN 2010»
15 years 3 months ago
Optimal Gathering Algorithms in Multi-Hop Radio Tree-Networks with Interferences
We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network,...
Jean-Claude Bermond, Min-Li Yu