301 search results - page 15 / 61 » On Finding Dense Subgraphs |
ASPDAC
2004
ACM
15 years 1 months ago
2004
ACM
- Minimum area is one of the important objectives in technology mapping for lookup table-based FPGAs. It has been proven that the problem is NP-complete. This paper presents a poly...
118
click to vote
DICTA
2009
14 years 10 months ago
2009
Abstract--The relationship between multiple cameras viewing the same scene may be discovered automatically by finding corresponding points in the two views and then solving for the...
65
Voted
ICASSP
2010
IEEE
14 years 9 months ago
2010
IEEE
Graphs are canonical examples of high-dimensional non-Euclidean data sets, and are emerging as a common data structure in many fields. While there are many algorithms to analyze ...
96
Voted
SIGMOD
2010
ACM
14 years 9 months ago
2010
ACM
Discriminative subgraphs are widely used to define the feature space for graph classification in large graph databases. Several scalable approaches have been proposed to mine disc...
ECEASST
2006
14 years 9 months ago
2006
Mining for frequent subgraphs in a graph database has become a popular topic in the last years. Algorithms to solve this problem are used in chemoinformatics to find common molecul...