Sciweavers

267 search results - page 26 / 54
» Core Decomposition in Graphs: Concepts, Algorithms and Appli...
Sort
View
SC
2009
ACM
14 years 3 months ago
Evaluating use of data flow systems for large graph analysis
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...
Andy Yoo, Ian Kaplan
SEMWEB
2007
Springer
14 years 2 months ago
Structure Preserving Semantic Matching
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...
Fausto Giunchiglia, Mikalai Yatskevich, Fiona McNe...
FCCM
2009
IEEE
192views VLSI» more  FCCM 2009»
14 years 3 months ago
FPGA Floating Point Datapath Compiler
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 ...
Martin Langhammer, Tom VanCourt
KAIS
2011
129views more  KAIS 2011»
13 years 3 months ago
Counting triangles in real-world networks using projections
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...
Charalampos E. Tsourakakis
FPL
2007
Springer
99views Hardware» more  FPL 2007»
14 years 15 days ago
Disjoint Pattern Enumeration for Custom Instructions Identification
Extensible processors allow addition of application-specific custom instructions to the core instruction set architecture. These custom instructions are selected through an analys...
Pan Yu, Tulika Mitra