1687 search results - page 221 / 338 » Personalizing Information Spaces: A Metadata Based Approach |
KDD
2008
ACM
14 years 9 months ago
2008
ACM
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
SIGMOD
2008
ACM
14 years 9 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
KDD
2010
ACM
13 years 7 months ago
2010
ACM
The problem of graph classification has attracted great interest in the last decade. Current research on graph classification assumes the existence of large amounts of labeled tra...
DATE
1999
IEEE
14 years 1 months ago
1999
IEEE
In this paper, new and efficient BIST methodology and BIST hardware insertion algorithms are presented for RTL data paths obtained from high level synthesis. The methodology is ba...
SIGMOD
2010
ACM
13 years 9 months ago
2010
ACM
Automated extraction of structured data from Web sources often leads to large heterogeneous knowledge bases (KB), with data and schema items numbering in the hundreds of thousands...