Sciweavers

1146 search results - page 125 / 230
» Finite cupping sets
Sort
View
ICML
2009
IEEE
14 years 11 months ago
Bayesian inference for Plackett-Luce ranking models
This paper gives an efficient Bayesian method for inferring the parameters of a PlackettLuce ranking model. Such models are parameterised distributions over rankings of a finite s...
John Guiver, Edward Snelson
CADE
2006
Springer
14 years 10 months ago
Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems
Abstract. Semantic labelling is a transformational technique for proving termination of Term Rewriting Systems (TRSs). Only its variant with finite sets of labels was used so far i...
Adam Koprowski, Hans Zantema
STOC
2003
ACM
136views Algorithms» more  STOC 2003»
14 years 10 months ago
Alpha-shapes and flow shapes are homotopy equivalent
In this paper we establish a topological similarity between two apparently different shape constructors from a set of points. Shape constructors are geometric structures that tran...
Tamal K. Dey, Joachim Giesen, Matthias John
LATIN
1992
Springer
14 years 2 months ago
On Reversible Automata
A reversible automaton is a finite (possibly incomplete) automaton in which each letter induces a partial one-to-one map from the set of states into itself. We give four non-trivi...
Jean-Eric Pin
ICASSP
2009
IEEE
14 years 2 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...