Sciweavers

620 search results - page 42 / 124
» The edge-flipping group of a graph
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...
AAAI
1998
13 years 10 months ago
Hermes: Supporting Argumentative Discourse in Multi-Agent Decision Making
This paper describes HERMES,a system that enhances group decision making by providing an argumentation frameworkto the agents involved. Thesystem organizes the existing knowledgei...
Nikos I. Karacapilidis, Dimitris Papadias
FCT
2009
Springer
14 years 3 months ago
Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
Peter Damaschke, Azam Sheikh Muhammad
COMBINATORICS
2006
109views more  COMBINATORICS 2006»
13 years 9 months ago
The Strongly Regular (45, 12, 3, 3) Graphs
Using two backtrack algorithms based on different techniques, designed and implemented independently, we were able to determine up to isomorphism all strongly regular graphs with ...
Kris Coolsaet, Jan Degraer, Edward Spence
COMBINATORICS
2000
142views more  COMBINATORICS 2000»
13 years 8 months ago
Harmonic Functions on Multiplicative Graphs and Interpolation Polynomials
We construct examples of nonnegative harmonic functions on certain graded graphs: the Young lattice and its generalizations. Such functions first emerged in harmonic analysis on th...
Alexei Borodin, Grigori Olshanski