Sciweavers

678 search results - page 99 / 136
» Structural Properties of Sparse Graphs
Sort
View
IPPS
1996
IEEE
13 years 11 months ago
Commutativity Analysis: A Technique for Automatically Parallelizing Pointer-Based Computations
This paper introduces an analysis technique, commutativity analysis, for automatically parallelizing computations that manipulate dynamic, pointer-based data structures. Commutati...
Martin C. Rinard, Pedro C. Diniz
INFOCOM
2006
IEEE
14 years 1 months ago
Collaboration Improves the Connectivity of Wireless Networks
— In the standard approach to studying connectivity, a physical layer is assumed that allows direct transmission between neighbors within some fixed distance. The graph resultin...
Sanquan Song, Dennis Goeckel, Donald F. Towsley
WAW
2010
Springer
312views Algorithms» more  WAW 2010»
13 years 5 months ago
The Geometric Protean Model for On-Line Social Networks
We introduce a new geometric, rank-based model for the link structure of on-line social networks (OSNs). In the geo-protean (GEO-P) model for OSNs nodes are identified with points ...
Anthony Bonato, Jeannette Janssen, Pawel Pralat
ICASSP
2011
IEEE
12 years 11 months ago
A comparative analysis of dynamic network decoding
The use of statically compiled search networks for ASR systems using huge vocabularies and complex language models often becomes challenging in terms of memory requirements. Dynam...
David Rybach, Ralf Schlüter, Hermann Ney
SDM
2009
SIAM
167views Data Mining» more  SDM 2009»
14 years 4 months ago
Detecting Communities in Social Networks Using Max-Min Modularity.
Many datasets can be described in the form of graphs or networks where nodes in the graph represent entities and edges represent relationships between pairs of entities. A common ...
Jiyang Chen, Osmar R. Zaïane, Randy Goebel