5019 search results - page 24 / 1004 » Computing in Quotient Groups |
124
click to vote
IROS
2006
IEEE
15 years 8 months ago
2006
IEEE
Abstract— We present a computational framework for automatic deployment of robots in 2D and 3D rectangular environments with polytopal obstacles. The results are derived for poly...
113
Voted
ARITH
2005
IEEE
15 years 7 months ago
2005
IEEE
Integer division on modern processors is expensive compared to multiplication. Previous algorithms for performing unsigned division by an invariant divisor, via reciprocal approxi...
ISSAC
2005
Springer
15 years 7 months ago
2005
Springer
This paper describes a new method for computing the normal form of a polynomial modulo a zero-dimensional ideal I. We give a detailed description of the algorithm, a proof of its ...
106
Voted
ARITH
1997
IEEE
15 years 6 months ago
1997
IEEE
SRT dividers are common in modern floating point units. Higher division performance is achieved by retiring more quotient bits in each cycle. Previous research has shown that rea...
86
Voted
DCC
2010
IEEE
15 years 1 months ago
2010
IEEE
This article studies the small weight codewords of the functional code CHerm(X), with X a non-singular Hermitian variety of PG(N, q2). The main result of this article is that the ...