Sciweavers

1039 search results - page 76 / 208
» Kernels and Regularization on Graphs
Sort
View
65
Voted
JGT
2010
93views more  JGT 2010»
14 years 11 months ago
An asymptotic version of a conjecture by Enomoto and Ota
. Dirac. Some theorems on abstract graphs. Proc. London Math. Soc. (3), 2:69–81, 1952. [2] Hikoe Enomoto and Katsuhiro Ota. Partitions of a graph into paths with prescribed endve...
Colton Magnant, Daniel M. Martin
128
Voted
FAW
2007
Springer
177views Algorithms» more  FAW 2007»
15 years 6 months ago
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
Hannes Moser, Somnath Sikdar
FSTTCS
1994
Springer
15 years 4 months ago
Finite-State Strategies in Regular Infinite Games
Abstract. This paper surveys work on the synthesis of reactive programs which implement winning strategies in infinite two-person games. The representation of such games by Muller ...
Wolfgang Thomas
90
Voted
FSTTCS
2008
Springer
15 years 1 months ago
An Optimal Construction of Finite Automata from Regular Expressions
We consider the construction of finite automata from their corresponding regular expressions by a series of digraph-transformations along the expression’s structure. Each interm...
Stefan Gulan, Henning Fernau
ICDM
2003
IEEE
135views Data Mining» more  ICDM 2003»
15 years 6 months ago
An Algorithm for the Exact Computation of the Centroid of Higher Dimensional Polyhedra and its Application to Kernel Machines
The Support Vector Machine (SVM) solution corresponds to the centre of the largest sphere inscribed in version space. Alternative approaches like Bayesian Point Machines (BPM) and...
Frédéric Maire