Sciweavers

2503 search results - page 186 / 501
» A study of 3-arc graphs
Sort
View
IPPS
2006
IEEE
16 years 19 days ago
Concurrent counting is harder than queuing
In both distributed counting and queuing, processors in a distributed system issue operations which are organized into a total order. In counting, each processor receives the rank...
Srikanta Tirthapura, Costas Busch
SYNASC
2006
IEEE
106views Algorithms» more  SYNASC 2006»
16 years 18 days ago
A Quality Measure for Multi-Level Community Structure
Mining relational data often boils down to computing clusters, that is finding sub-communities of data elements forming cohesive sub-units, while being well separated from one an...
Maylis Delest, Jean-Marc Fedou, Guy Melanço...
VALUETOOLS
2006
ACM
107views Hardware» more  VALUETOOLS 2006»
16 years 16 days ago
Thresholds for virus spread on networks
We study how the spread of computer viruses, worms, and other self-replicating malware is affected by the logical topology of the network over which they propagate. We consider a...
Moez Draief, Ayalvadi J. Ganesh, Laurent Massouli&...
ISCC
2005
IEEE
16 years 5 days ago
Hierarchical Peer-to-Peer Networks Using Lightweight SuperPeer Topologies
The use of SuperPeers has been proposed to improve the performance of both Structured and Unstructured Peer-toPeer (P2P) Networks. In this paper, we study the performance of Yao-G...
Michael Kleis, Eng Keong Lua, Xiaoming Zhou
RSP
2005
IEEE
16 years 5 days ago
Porting DSP Applications across Design Tools Using the Dataflow Interchange Format
Modeling DSP applications through coarse-grain dataflow graphs is popular in the DSP design community, and a growing set of rapid prototyping tools support such dataflow semantics...
Chia-Jui Hsu, Shuvra S. Bhattacharyya