1297 search results - page 91 / 260 » Dynamic Object Process Graphs |
121
Voted
APPROX
2006
Springer
15 years 4 months ago
2006
Springer
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
113
Voted
DICTA
2003
15 years 2 months ago
2003
Most codecs such as MPEG-1,2 are based on processing pixels in predetermined tiles of square blocks. The processing of each block is independent of the object-based contents that m...
114
click to vote
PKDD
2010
Springer
14 years 10 months ago
2010
Springer
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
107
Voted
FCCM
2008
IEEE
15 years 29 days ago
2008
IEEE
Communications infrastructure for modular reconfiguration of FPGAs needs to support the changing communications interfaces of a sequence of modules. In order to avoid the overhead...
103
Voted
CDC
2009
IEEE
15 years 5 months ago
2009
IEEE
— In this paper, we study the dynamics of a viral spreading process in random geometric graphs (RGG). The spreading of the viral process we consider in this paper is closely rela...