Sciweavers

477 search results - page 63 / 96
» Storing RDF as a Graph
Sort
View
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
14 years 4 months ago
ACOhg: dealing with huge graphs
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
Enrique Alba, J. Francisco Chicano
EDBT
2008
ACM
150views Database» more  EDBT 2008»
14 years 10 months ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin
WWW
2007
ACM
14 years 10 months ago
Dynamic personalized pagerank in entity-relation graphs
Extractors and taggers turn unstructured text into entityrelation (ER) graphs where nodes are entities (email, paper, person, conference, company) and edges are relations (wrote, ...
Soumen Chakrabarti
DBSEC
2010
196views Database» more  DBSEC 2010»
13 years 6 months ago
Preserving Integrity and Confidentiality of a Directed Acyclic Graph Model of Provenance
Abstract. This paper describes how to preserve integrity and confidentiality of a directed acyclic graph (DAG) model of provenance database. We show a method to preserve integrity ...
Amril Syalim, Takashi Nishide, Kouichi Sakurai
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
14 years 10 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel