Sciweavers

2861 search results - page 541 / 573
» The multi-layered network design problem
Sort
View
CIKM
2007
Springer
14 years 2 months ago
Top-k subgraph matching query in a large graph
Recently, due to its wide applications, subgraph search has attracted a lot of attention from database and data mining community. Sub-graph search is defined as follows: given a ...
Lei Zou, Lei Chen 0002, Yansheng Lu
DSN
2005
IEEE
14 years 1 months ago
ADEPTS: Adaptive Intrusion Response Using Attack Graphs in an E-Commerce Environment
Distributed systems with multiple interacting services, such as distributed e-commerce systems, are suitable targets for malicious attacks because of the potential financial impac...
Bingrui Foo, Yu-Sung Wu, Yu-Chun Mao, Saurabh Bagc...
SAGA
2005
Springer
14 years 1 months ago
Self-replication, Evolvability and Asynchronicity in Stochastic Worlds
We consider temporal aspects of self-replication and evolvability – in particular, the massively asynchronous parallel and distributed nature of living systems. Formal views of s...
Chrystopher L. Nehaniv
SIGCOMM
2004
ACM
14 years 1 months ago
The feasibility of supporting large-scale live streaming applications with dynamic application end-points
While application end-point architectures have proven to be viable solutions for large-scale distributed applications such as distributed computing and file-sharing, there is lit...
Kunwadee Sripanidkulchai, Aditya Ganjam, Bruce M. ...
SPAA
2004
ACM
14 years 1 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter