Sciweavers

1321 search results - page 35 / 265
» Quadratic forms on graphs
Sort
View
PVLDB
2008
116views more  PVLDB 2008»
13 years 9 months ago
Anonymizing bipartite graph data using safe groupings
Private data often comes in the form of associations between entities, such as customers and products bought from a pharmacy, which are naturally represented in the form of a larg...
Graham Cormode, Divesh Srivastava, Ting Yu, Qing Z...
NIPS
2008
13 years 11 months ago
Bayesian Network Score Approximation using a Metagraph Kernel
Many interesting problems, including Bayesian network structure-search, can be cast in terms of finding the optimum value of a function over the space of graphs. However, this fun...
Benjamin Yackley, Eduardo Corona, Terran Lane
SIAMCOMP
1998
124views more  SIAMCOMP 1998»
13 years 9 months ago
Near-Linear Time Construction of Sparse Neighborhood Covers
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...
Baruch Awerbuch, Bonnie Berger, Lenore Cowen, Davi...
KR
2004
Springer
14 years 3 months ago
Improving the Forward Chaining Algorithm for Conceptual Graphs Rules
Simple Conceptual Graphs (SGs) are used to represent entities and relations between these entities: they can be translated into positive, conjunctive, existential first-order log...
Jean-François Baget
ICPR
2002
IEEE
14 years 11 months ago
GraphGrep: A Fast and Universal Method for Querying Graphs
GraphGrep is an application-independent method for querying graphs, finding all the occurrences of a subgraph in a database of graphs. The interface to GraphGrep is a regular expr...
Rosalba Giugno, Dennis Shasha