142 search results - page 10 / 29 » Generalizing Graphs Using Amalgamation and Selection |
182
click to vote
VLDB
2007
ACM
15 years 12 months ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
101
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...
105
click to vote
KDD
2010
ACM
14 years 10 months ago
2010
ACM
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
BROADNETS
2005
IEEE
15 years 5 months ago
2005
IEEE
— Ethernet over SONET (EoS) is a popular approach for interconnecting geographically distant Ethernet segments using a SONET transport infrastructure. It typically uses virtual c...
134
click to vote
CIKM
2005
Springer
15 years 5 months ago
2005
Springer
Many bioinformatics applications would benefit from comparing proteins based on their biological role rather than their sequence. In most biological databases, proteins are alrea...