4972 search results - page 235 / 995 » Ranking on graph data |
171
click to vote
OTM
2010
Springer
15 years 4 months ago
2010
Springer
The GRASIM (Graph-Aided Similarity calculation) algorithm is designed to solve the problem of ontology-based data matching. We subdivide the matching problem into the ones of restr...
165
click to vote
SDM
2004
SIAM
15 years 8 months ago
2004
SIAM
How does a `normal' computer (or social) network look like? How can we spot `abnormal' sub-networks in the Internet, or web graph? The answer to such questions is vital ...
186
click to vote
TOG
2002
15 years 6 months ago
2002
In this paper we present a novel method for creating realistic, controllable motion. Given a corpus of motion capture data, we automatically construct a directed graph called a mo...
184
click to vote
CSR
2009
Springer
16 years 1 months ago
2009
Springer
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σp 2 . In the case of linear matroids, which are represented over poly...
194
click to vote
AOSD
2007
ACM
15 years 10 months ago
2007
ACM
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...