Sciweavers

6598 search results - page 16 / 1320
» Graph Theory with Applications
Sort
View
DAC
2006
ACM
16 years 20 days ago
Exploring trade-offs in buffer requirements and throughput constraints for synchronous dataflow graphs
Multimedia applications usually have throughput constraints. An implementation must meet these constraints, while it minimizes resource usage and energy consumption. The compute i...
Sander Stuijk, Marc Geilen, Twan Basten
KDD
2009
ACM
185views Data Mining» more  KDD 2009»
16 years 7 days ago
On compressing social networks
Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be com...
Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, ...
NETWORK
2010
122views more  NETWORK 2010»
14 years 6 months ago
Betweenness centrality and resistance distance in communication networks
In this article we report on applications and extensions of weighted graph theory in the design and control of communication networks. We model the communication network as a weig...
Ali Tizghadam, Alberto Leon-Garcia
JAIR
2006
89views more  JAIR 2006»
14 years 11 months ago
Distributed Reasoning in a Peer-to-Peer Setting: Application to the Semantic Web
In a peer-to-peer inference system, each peer can reason locally but can also solicit some of its acquaintances, which are peers sharing part of its vocabulary. In this paper, we ...
Philippe Adjiman, Philippe Chatalic, Franço...
92
Voted
ARSCOM
2006
202views more  ARSCOM 2006»
14 years 11 months ago
Domination in Planar Graphs with Small Diameter II
MacGillivray and Seyffarth (J. Graph Theory 22 (1996), 213
Michael Dorfling, Wayne Goddard, Michael A. Hennin...