Sciweavers

1605 search results - page 24 / 321
» On Partitional Labelings of Graphs
Sort
View
ICML
2005
IEEE
16 years 3 months ago
Learning from labeled and unlabeled data on a directed graph
We propose a general framework for learning from labeled and unlabeled data on a directed graph in which the structure of the graph including the directionality of the edges is co...
Bernhard Schölkopf, Dengyong Zhou, Jiayuan Hu...
104
Voted
ESANN
2003
15 years 4 months ago
High-dimensional labeled data analysis with Gabriel graphs
We propose the use of the Gabriel graph for the exploratory analysis of potentially high dimensional labeled data. Gabriel graph is a subgraph of the Delaunay triangulation, which ...
Michaël Aupetit
110
Voted
IJCAI
2007
15 years 4 months ago
A Labeling Approach to the Computation of Credulous Acceptance in Argumentation
In recent years, the combinatorics of argumentation with arguments that can attack each other has been studied extensively. Especially, attack graphs (put in the focus of attentio...
Bart Verheij
FOCS
2009
IEEE
15 years 9 months ago
Local Graph Partitions for Approximation and Testing
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguy...
125
Voted
CSL
2006
Springer
15 years 6 months ago
On Rational Trees
Rational graphs are a family of graphs defined using labelled rational transducers. Unlike automatic graphs (defined using synchronized transducers) the first order theory of these...
Arnaud Carayol, Christophe Morvan