Sciweavers

2531 search results - page 93 / 507
» Group testing in graphs
Sort
View
100
Voted
ESA
1999
Springer
95views Algorithms» more  ESA 1999»
15 years 5 months ago
A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
Xin He, Ming-Yang Kao, Hsueh-I Lu
93
Voted
WWW
2005
ACM
16 years 1 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
15 years 2 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
108
Voted
CORR
2008
Springer
130views Education» more  CORR 2008»
15 years 24 days ago
A Kernel Method for the Two-Sample Problem
We propose two statistical tests to determine if two samples are from different distributions. Our test statistic is in both cases the distance between the means of the two sample...
Arthur Gretton, Karsten M. Borgwardt, Malte J. Ras...
EASSS
2001
Springer
15 years 5 months ago
Cooperating Physical Robots: A Lesson in Playing Robotic Soccer
Having a robot that carries out a task for you is certainly of some help. Having a group of robots seems to be even better because in this case the task may be finished faster and...
Bernhard Nebel