Sciweavers

773 search results - page 38 / 155
» Traversing the Machining Graph
Sort
View
93
Voted
SSS
2010
Springer
134views Control Systems» more  SSS 2010»
15 years 8 days ago
Storage Capacity of Labeled Graphs
We consider the question of how much information can be stored by labeling the vertices of a connected undirected graph G using a constant-size set of labels, when isomorphic label...
Dana Angluin, James Aspnes, Rida A. Bazzi, Jiang C...
114
Voted
TCS
2008
15 years 1 months ago
Setting port numbers for fast graph exploration
We consider the problem of periodic graph exploration by a finite automaton in which an automaton with a constant number of states has to explore all unknown anonymous graphs of a...
David Ilcinkas
148
Voted
ICML
2007
IEEE
16 years 2 months ago
Entire regularization paths for graph data
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...
Koji Tsuda
ICASSP
2009
IEEE
15 years 5 months ago
High-level feature extraction using SVM with walk-based graph kernel
We investigate a method using support vector machines (SVMs) with walk-based graph kernels for high-level feature extraction from images. In this method, each image is first segme...
Jean-Philippe Vert, Tomoko Matsui, Shin'ichi Satoh...
108
Voted
CORR
2008
Springer
108views Education» more  CORR 2008»
15 years 1 months ago
Hierarchical Bag of Paths for Kernel Based Shape Classification
Graph kernels methods are based on an implicit embedding of graphs within a vector space of large dimension. This implicit embedding allows to apply to graphs methods which where u...
François-Xavier Dupé, Luc Brun