Sciweavers

292 search results - page 1 / 59
» Algorithms for Structural and Dynamical Polychronous Groups ...
Sort
View
ICANN
2009
Springer
14 years 14 days ago
Algorithms for Structural and Dynamical Polychronous Groups Detection
Polychronization has been proposed as a possible way to investigate the notion of cell assemblies and to understand their role as memory supports for information coding. In a spiki...
Régis Martinez, Hélène Paugam...
INFOCOM
2011
IEEE
12 years 9 months ago
Adaptive algorithms for detecting community structure in dynamic social networks
—Social networks exhibit a very special property: community structure. Understanding the network community structure is of great advantages. It not only provides helpful informat...
Nam P. Nguyen, Thang N. Dinh, Ying Xuan, My T. Tha...
PG
2003
IEEE
13 years 11 months ago
Adaptive Grouping and Subdivision for Simulating Hair Dynamics
We present a novel approach for adaptively grouping and subdividing hair using discrete level-of-detail (LOD) representations. The set of discrete LODs include hair strands, clust...
Kelly Ward, Ming C. Lin
IWCMC
2010
ACM
13 years 11 months ago
Group detection in mobility traces
—Analysis and modeling of wireless networks greatly depend on understanding the structure of underlying mobile nodes. In this paper we present two clustering algorithms to determ...
Yung-Chih Chen, Elisha J. Rosensweig, Jim Kurose, ...
ICCV
2009
IEEE
13 years 3 months ago
Learning with dynamic group sparsity
This paper investigates a new learning formulation called dynamic group sparsity. It is a natural extension of the standard sparsity concept in compressive sensing, and is motivat...
Junzhou Huang, Xiaolei Huang, Dimitris N. Metaxas