Sciweavers

2137 search results - page 312 / 428
» Approximation Algorithms for Some Graph Partitioning Problem...
Sort
View
ICPR
2010
IEEE
15 years 12 months ago
Integrating a Discrete Motion Model into GMM Based Background Subtraction
GMM based algorithms have become the de facto standard for background subtraction in video sequences, mainly because of their ability to track multiple background distributions, w...
Christian Wolf, Jolion Jolion
188
Voted
CIKM
2010
Springer
15 years 3 months ago
SHRINK: a structural clustering algorithm for detecting hierarchical communities in networks
Community detection is an important task for mining the structure and function of complex networks. Generally, there are several different kinds of nodes in a network which are c...
Jianbin Huang, Heli Sun, Jiawei Han, Hongbo Deng, ...
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
15 years 10 months ago
Takeover time curves in random and small-world structured populations
We present discrete stochastic mathematical models for the growth curves of synchronous and asynchronous evolutionary algorithms with populations structured according to a random ...
Mario Giacobini, Marco Tomassini, Andrea Tettamanz...
DIS
2009
Springer
15 years 11 months ago
CHRONICLE: A Two-Stage Density-Based Clustering Algorithm for Dynamic Networks
Abstract. Information networks, such as social networks and that extracted from bibliographic data, are changing dynamically over time. It is crucial to discover time-evolving comm...
Min-Soo Kim 0002, Jiawei Han
148
Voted
INFOCOM
2007
IEEE
15 years 11 months ago
Minimum-Latency Broadcast Scheduling in Wireless Ad Hoc Networks
— A wide range of applications for wireless ad hoc networks are time-critical and impose stringent requirement on the communication latency. This paper studies the problem Minimu...
Scott C.-H. Huang, Peng-Jun Wan, Xiaohua Jia, Hong...