Sciweavers

1274 search results - page 97 / 255
» Graph lambda theories
Sort
View
WWW
2005
ACM
14 years 9 months ago
Signing individual fragments of an RDF graph
Being able to determine the provenience of statements is a fundamental step in any SW trust modeling. We propose a methodology that allows signing of small groups of RDF statement...
Giovanni Tummarello, Christian Morbidoni, Paolo Pu...
SIGECOM
2003
ACM
124views ECommerce» more  SIGECOM 2003»
14 years 2 months ago
Coalitional games on graphs: core structure, substitutes and frugality
We study mechanisms that can be modelled as coalitional games with transferable utilities, and apply ideas from mechanism design and game theory to problems arising in a network d...
Rahul Garg, Vijay Kumar, Atri Rudra, Akshat Verma
GLVLSI
2002
IEEE
160views VLSI» more  GLVLSI 2002»
14 years 1 months ago
Computing walsh, arithmetic, and reed-muller spectral decision diagrams using graph transformations
Spectral techniques have found many applications in computeraided design, including synthesis, verification, and testing. Decision diagram representations permit spectral coeffici...
Whitney J. Townsend, Mitchell A. Thornton, Rolf Dr...
CORR
2007
Springer
95views Education» more  CORR 2007»
13 years 9 months ago
Support-Graph Preconditioners for 2-Dimensional Trusses
We use support theory, in particular the fretsaw extensions of Shklarski and Toledo [ST06a], to design preconditioners for the stiffness matrices of 2-dimensional truss structure...
Samuel I. Daitch, Daniel A. Spielman
AI
2010
Springer
13 years 9 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim