Sciweavers

1528 search results - page 177 / 306
» On Signatures for Communication Graphs
Sort
View
FUIN
2008
98views more  FUIN 2008»
13 years 9 months ago
A Restarted Strategy for Efficient Subsumption Testing
We study runtime distributions of subsumption testing. On graph data randomly sampled from two different generative models we observe a gradual growth of the tails of the distribut...
Ondrej Kuzelka, Filip Zelezný
JPDC
2007
177views more  JPDC 2007»
13 years 9 months ago
Adaptive decomposition and remapping algorithms for object-space-parallel direct volume rendering of unstructured grids
Object space (OS) parallelization of an efficient direct volume rendering algorithm for unstructured grids on distributed-memory architectures is investigated. The adaptive OS de...
Cevdet Aykanat, Berkant Barla Cambazoglu, Ferit Fi...
ALGORITHMICA
1998
184views more  ALGORITHMICA 1998»
13 years 9 months ago
Approximation Algorithms for Connected Dominating Sets
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
Sudipto Guha, Samir Khuller
ACSAC
2010
IEEE
13 years 7 months ago
Toward worm detection in online social networks
Worms propagating in online social networking (OSN) websites have become a major security threat to both the websites and their users in recent years. Since these worms exhibit un...
Wei Xu, Fangfang Zhang, Sencun Zhu
WD
2010
13 years 7 months ago
Self-organized aggregation in irregular wireless networks
Gossip-based epidemic protocols are used to aggregate data in distributed systems. This fault-tolerant approach does neither require maintenance of any global network state nor kno...
Joanna Geibig, Dirk Bradler