195 search results - page 37 / 39 » A Riemannian approach to graph embedding |
SAC
2005
ACM
14 years 1 months ago
2005
ACM
The popularity of email has triggered researchers to look for ways to help users better organize the enormous amount of information stored in their email folders. One challenge th...
SPAA
1997
ACM
13 years 12 months ago
1997
ACM
- Partitioning unstructured graphs is central to the parallel solution of computational science and engineering problems. Spectral partitioners, such recursive spectral bisection (...
COMPGEOM
2011
ACM
12 years 11 months ago
2011
ACM
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
ICDM
2009
IEEE
14 years 2 months ago
2009
IEEE
—Identifying modules, or natural communities, in large complex networks is fundamental in many fields, including social sciences, biological sciences and engineering. Recently s...
SEMWEB
2007
Springer
14 years 1 months ago
2007
Springer
In this paper, we present the AgreementMaker, an ontology alignment tool that incorporates the Descendants Similarity Inheritance (DSI) method. This method uses the structure of th...