Sciweavers

221 search results - page 22 / 45
» Graph matching with type constraints on nodes and edges
Sort
View
BMCBI
2008
208views more  BMCBI 2008»
13 years 7 months ago
GraphFind: enhancing graph searching by low support data mining techniques
Background: Biomedical and chemical databases are large and rapidly growing in size. Graphs naturally model such kinds of data. To fully exploit the wealth of information in these...
Alfredo Ferro, Rosalba Giugno, Misael Mongiov&igra...
COR
2008
142views more  COR 2008»
13 years 7 months ago
Modeling and solving the rooted distance-constrained minimum spanning tree problem
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
Luis Gouveia, Ana Paias, Dushyant Sharma
CORR
2010
Springer
167views Education» more  CORR 2010»
13 years 5 months ago
Compressive Sensing over Graphs
In this paper, motivated by network inference and tomography applications, we study the problem of compressive sensing for sparse signal vectors over graphs. In particular, we are ...
Weiyu Xu, Enrique Mallada, Ao Tang
ICNP
2005
IEEE
14 years 1 months ago
On Static and Dynamic Partitioning Behavior of Large-Scale Networks
In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node failure affec...
Derek Leonard, Zhongmei Yao, Xiaoming Wang, Dmitri...
PR
2007
81views more  PR 2007»
13 years 7 months ago
Graph embedding using tree edit-union
In this paper we address the problem of how to learn a structural prototype that can be used to represent the variations present in a set of trees. The prototype serves as a patte...
Andrea Torsello, Edwin R. Hancock