267 search results - page 26 / 54 » Core Decomposition in Graphs: Concepts, Algorithms and Appli... |
151
click to vote
SC
2009
ACM
16 years 15 days ago
2009
ACM
Large graph analysis has become increasingly important and is widely used in many applications such as web mining, social network analysis, biology, and information retrieval. The...
141
click to vote
SEMWEB
2007
Springer
15 years 11 months ago
2007
Springer
Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...
162
click to vote
FCCM
2009
IEEE
16 years 14 days ago
2009
IEEE
This paper will describe the architecture of a compiler which will convert an untimed C description of a set of floating point expressions into a synthesizable datapath optimized ...
187
Voted
KAIS
2011
15 years 20 days ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
173
click to vote
FPL
2007
Springer
15 years 9 months ago
2007
Springer
Extensible processors allow addition of application-specific custom instructions to the core instruction set architecture. These custom instructions are selected through an analys...