Sciweavers

404 search results - page 33 / 81
» Correlation search in graph databases
Sort
View
CLUSTER
2006
IEEE
14 years 2 months ago
MSSG: A Framework for Massive-Scale Semantic Graphs
This paper presents a middleware framework for storing, accessing and analyzing massive-scale semantic graphs. The framework, MSSG, targets scale-free semantic graphs with O(1012 ...
Timothy D. R. Hartley, Ümit V. Çataly&...
WWW
2007
ACM
14 years 9 months ago
On building graphs of documents with artificial ants
We present an incremental algorithm for building a neighborhood graph from a set of documents. This algorithm is based on a population of artificial agents that imitate the way re...
Hanane Azzag, Julien Lavergne, Christiane Guinot, ...
CIKM
2011
Springer
12 years 8 months ago
Detecting anomalies in graphs with numeric labels
This paper presents Yagada, an algorithm to search labelled graphs for anomalies using both structural data and numeric attributes. Yagada is explained using several security-rela...
Michael Davis, Weiru Liu, Paul Miller, George Redp...
ICDE
2006
IEEE
192views Database» more  ICDE 2006»
14 years 10 months ago
Approximating Aggregation Queries in Peer-to-Peer Networks
Peer-to-peer databases are becoming prevalent on the Internet for distribution and sharing of documents, applications, and other digital media. The problem of answering large scal...
Benjamin Arai, Gautam Das, Dimitrios Gunopulos, Va...
CPC
2002
80views more  CPC 2002»
13 years 8 months ago
The Wiener Index Of Random Trees
The Wiener index is analyzed for random recursive trees and random binary search trees in the uniform probabilistic models. We obtain the expectations, asymptotics for the varianc...
Ralph Neininger