Sciweavers

221 search results - page 28 / 45
» Graph matching with type constraints on nodes and edges
Sort
View
SODA
2007
ACM
127views Algorithms» more  SODA 2007»
13 years 9 months ago
Line-of-sight networks
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren ...
IPMU
2010
Springer
13 years 9 months ago
The Link Prediction Problem in Bipartite Networks
We define and study the link prediction problem in bipartite networks, specializing general link prediction algorithms to the bipartite case. In a graph, a link prediction functio...
Jérôme Kunegis, Ernesto William De Lu...
COLING
2010
13 years 2 months ago
A Formal Scheme for Multimodal Grammars
We present in this paper a formal approach for the representation of multimodal information. This approach, thanks to the to use of typed feature structures and hypergraphs, gener...
Philippe Blache, Laurent Prévot
SCALESPACE
2005
Springer
14 years 1 months ago
Discrete Representation of Top Points via Scale Space Tessellation
In previous work, singular points (or top points) in the scale space representation of generic images have proven valuable for image matching. In this paper, we propose a construct...
Bram Platel, M. Fatih Demirci, Ali Shokoufandeh, L...
SDM
2009
SIAM
192views Data Mining» more  SDM 2009»
14 years 4 months ago
Mining Cohesive Patterns from Graphs with Feature Vectors.
The increasing availability of network data is creating a great potential for knowledge discovery from graph data. In many applications, feature vectors are given in addition to g...
Arash Rafiey, Flavia Moser, Martin Ester, Recep Co...