Sciweavers

792 search results - page 133 / 159
» Measuring complexity by measuring structure and organization
Sort
View
KDD
2009
ACM
180views Data Mining» more  KDD 2009»
15 years 2 months ago
Parallel community detection on large networks with propinquity dynamics
Graphs or networks can be used to model complex systems. Detecting community structures from large network data is a classic and challenging task. In this paper, we propose a nove...
Yuzhou Zhang, Jianyong Wang, Yi Wang, Lizhu Zhou
COMPGEOM
2005
ACM
14 years 11 months ago
Kinetic sorting and kinetic convex hulls
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
Mohammad Ali Abam, Mark de Berg
ICDM
2010
IEEE
230views Data Mining» more  ICDM 2010»
14 years 7 months ago
Clustering Large Attributed Graphs: An Efficient Incremental Approach
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
Yang Zhou, Hong Cheng, Jeffrey Xu Yu
IROS
2009
IEEE
132views Robotics» more  IROS 2009»
15 years 4 months ago
Automatic selection of task spaces for imitation learning
Abstract— Previous work [1] shows that the movement representation in task spaces offers many advantages for learning object-related and goal-directed movement tasks through imit...
Manuel Mühlig, Michael Gienger, Jochen J. Ste...
116
Voted
UBIMOB
2009
ACM
225views Management» more  UBIMOB 2009»
15 years 2 months ago
Historical data storage for large scale sensor networks
Wireless sensor networks are rapidly finding their way through a plethora of new applications like precision farming and forestry, with increasing network scale, system complexit...
Loïc Petit, Abdelhamid Nafaa, Raja Jurdak