7796 search results - page 226 / 1560 » On Generalized Schur Numbers |
138
click to vote
ICALP
2004
Springer
16 years 1 days ago
2004
Springer
We give a simple formulation of Karr’s algorithm for computing all affine relationships in affine programs. This simplified algorithm runs in time O(nk3 ) where n is the progr...
176
click to vote
KELSI
2004
Springer
16 years 22 hour ago
2004
Springer
Multiple sequence alignment (MSA) is a vital problem in biology. Optimal alignment of multiple sequences becomes impractical even for a modest number of sequences [1] since the gen...
175
click to vote
WG
2004
Springer
16 years 3 hour ago
2004
Springer
It has long been known that the number of spanning trees in circulant graphs with fixed jumps and n nodes satisfies a recurrence relation in n. The proof of this fact was algebra...
165
click to vote
ICRA
2003
IEEE
15 years 12 months ago
2003
IEEE
Abstract— In this paper we address the problem of interpreting sensory data for human-robot interaction, especially when gathered from several robots at the same time. After desc...
193
click to vote
EMMCVPR
2003
Springer
15 years 12 months ago
2003
Springer
In this paper, a novel general purpose clustering algorithm is presented, based on the watershed algorithm. The proposed approach defines a density function on a suitable lattice,...