Sciweavers

773 search results - page 31 / 155
» Traversing the Machining Graph
Sort
View
ICML
2010
IEEE
14 years 10 months ago
Large Graph Construction for Scalable Semi-Supervised Learning
In this paper, we address the scalability issue plaguing graph-based semi-supervised learning via a small number of anchor points which adequately cover the entire point cloud. Cr...
Wei Liu, Junfeng He, Shih-Fu Chang
ALGORITHMICA
2007
86views more  ALGORITHMICA 2007»
14 years 9 months ago
Detecting Holes and Antiholes in Graphs
In this paper we study the problems of detecting holes and antiholes in general undirected graphs, and we present algorithms for these problems. For an input graph G on n vertices ...
Stavros D. Nikolopoulos, Leonidas Palios
74
Voted
ICML
2007
IEEE
15 years 10 months ago
Scalable modeling of real graphs using Kronecker multiplication
Given a large, real graph, how can we generate a synthetic graph that matches its properties, i.e., it has similar degree distribution, similar (small) diameter, similar spectrum,...
Jure Leskovec, Christos Faloutsos
COMBINATORICA
2010
14 years 7 months ago
A superadditivity and submultiplicativity property for cardinalities of sumsets
For finite sets of integers A1, A2 . . . An we study the cardinality of the n-fold sumset A1 +
Katalin Gyarmati, Máté Matolcsi, Imr...
ICML
2007
IEEE
15 years 10 months ago
Learning from interpretations: a rooted kernel for ordered hypergraphs
The paper presents a kernel for learning from ordered hypergraphs, a formalization that captures relational data as used in Inductive Logic Programming (ILP). The kernel generaliz...
Gabriel Wachman, Roni Khardon