699 search results - page 71 / 140 » The method of combinatorial telescoping |
114
Voted
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
— We present a general method for proving upper bounds on the eigenvalues of the graph Laplacian. In particular, we show that for any positive integer k, the kth smallest eigenva...
115
Voted
IROS
2009
IEEE
15 years 10 months ago
2009
IEEE
— We address the mutual localization problem for a multi-robot system, under the assumption that each robot is equipped with a sensor that provides a measure of the relative posi...
134
click to vote
EPIA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this paper, we describe a novel approach to tackle intention recognition, by combining dynamically configurable and situation-sensitive Causal Bayes Networks plus pla...
133
click to vote
EUROCAST
2009
Springer
15 years 10 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
125
Voted
SARA
2009
Springer
15 years 10 months ago
2009
Springer
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each...