Sciweavers

4052 search results - page 54 / 811
» Using RDF to describe networks
Sort
View
ICCS
2009
Springer
14 years 4 months ago
Improving the Scalability of SimGrid Using Dynamic Routing
Research into large-scale distributed systems often relies on the use of simulation frameworks in order to bypass the disadvantages of performing experiments on real testbeds. SimG...
Silas De Munck, Kurt Vanmechelen, Jan Broeckhove
SDM
2009
SIAM
167views Data Mining» more  SDM 2009»
14 years 7 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
MOBICOM
2006
ACM
14 years 3 months ago
Localization in sparse networks using sweeps
Determining node positions is essential for many next-generation network functionalities. Previous localization algorithms lack correctness guarantees or require network density h...
David Kiyoshi Goldenberg, Pascal Bihler, Yang Rich...
DCOSS
2005
Springer
14 years 3 months ago
Macro-programming Wireless Sensor Networks Using Kairos
The literature on programming sensor networks has focused so far on g higher-level abstractions for expressing local node behavior. Kairos is a natural next step in sensor network ...
Ramakrishna Gummadi, Omprakash Gnawali, Ramesh Gov...
HICSS
2008
IEEE
156views Biometrics» more  HICSS 2008»
14 years 4 months ago
A Centrality Measure for Electrical Networks
—We derive a measure of “electrical centrality” for AC power networks, which describes the structure of the network as a function of its electrical topology rather than its p...
Paul Hines, Seth Blumsack