Sciweavers

2004 search results - page 134 / 401
» Sampling from large graphs
Sort
View
GBRPR
2009
Springer
15 years 9 months ago
Edition within a Graph Kernel Framework for Shape Recognition
A large family of shape comparison methods is based on a medial axis transform combined with an encoding of the skeleton by a graph. Despite many qualities this encoding of shapes ...
François-Xavier Dupé, Luc Brun
GD
2005
Springer
15 years 8 months ago
MultiPlane: A New Framework for Drawing Graphs in Three Dimensions
This paper presents a new framework for drawing graphs in three dimensions. In general, the new framework uses a divide and conquer approach. More specifically, the framework divi...
Seok-Hee Hong
AAAI
2004
15 years 4 months ago
A General Solution to the Graph History Interaction Problem
Since the state space of most games is a directed graph, many game-playing systems detect repeated positions with a transposition table. This approach can reduce search effort by ...
Akihiro Kishimoto, Martin Müller 0003
CSL
2004
Springer
15 years 3 months ago
Arc minimization in finite-state decoding graphs with cross-word acoustic context
Recent approaches to large vocabulary decoding with finite state graphs have focused on the use of state minimization algorithms to produce relatively compact graphs. This paper e...
François Yvon, Geoffrey Zweig, George Saon
KDD
2010
ACM
197views Data Mining» more  KDD 2010»
15 years 1 months ago
Semi-supervised feature selection for graph classification
The problem of graph classification has attracted great interest in the last decade. Current research on graph classification assumes the existence of large amounts of labeled tra...
Xiangnan Kong, Philip S. Yu