Sciweavers

569 search results - page 52 / 114
» Dynamic Factor Graphs for Time Series Modeling
Sort
View
COMGEO
1999
ACM
13 years 8 months ago
Dynamic algorithms for geometric spanners of small diameter: Randomized solutions
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
Sunil Arya, David M. Mount, Michiel H. M. Smid
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
14 years 9 months ago
Constant-factor approximation algorithms for identifying dynamic communities
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf
IAT
2009
IEEE
14 years 18 days ago
Multi-a(ge)nt Graph Patrolling and Partitioning
We introduce a novel multi agent patrolling algorithm inspired by the behavior of gas filled balloons. Very low capability ant-like agents are considered with the task of patrolli...
Yotam Elor, Alfred M. Bruckstein
DAM
2007
107views more  DAM 2007»
13 years 8 months ago
Eliminating graphs by means of parallel knock-out schemes
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...
WSC
2007
13 years 11 months ago
Modeling and simulation of retrieving process
This paper presents a model of Parts Distribution Center (PDC), developed in Arena® 5.0, which aims at providing information about the total time of the retrieving process as the...
Shih Y. Chin, José H. C. G. Júnior