Sciweavers

1930 search results - page 19 / 386
» A Dynamic Graph Algorithm for the Highly Dynamic Network Pro...
Sort
View
CORR
2008
Springer
153views Education» more  CORR 2008»
13 years 7 months ago
Decomposition Techniques for Subgraph Matching
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
Stéphane Zampelli, Martin Mann, Yves Devill...
ICCCN
2007
IEEE
14 years 1 months ago
Packet Buffer Management for a High-Speed Network Interface Card
— Packet buffers in a smart network interface card are managed in a way to reduce any packet losses from high-speed burst incoming data. Currently, two types of packet buffer man...
Shalini Batra, Yul Chu, Yan Bai
KDD
2009
ACM
132views Data Mining» more  KDD 2009»
14 years 8 months ago
Learning patterns in the dynamics of biological networks
Our dynamic graph-based relational mining approach has been developed to learn structural patterns in biological networks as they change over time. The analysis of dynamic network...
Chang Hun You, Lawrence B. Holder, Diane J. Cook
HPDC
2002
IEEE
14 years 11 days ago
Dynamic Monitoring of High-Performance Distributed Applications
Developers and users of high-performance distributed systems often observe performance problems such as unexpectedly low throughput or high latency. Determining the source of the ...
Dan Gunter, Brian Tierney, Keith R. Jackson, Jason...
INFOCOM
2009
IEEE
14 years 2 months ago
Hyperbolic Embedding and Routing for Dynamic Graphs
—We propose an embedding and routing scheme for arbitrary network connectivity graphs, based on greedy routing and utilizing virtual node coordinates. In dynamic multihop packet-...
Andrej Cvetkovski, Mark Crovella