Sciweavers

8094 search results - page 56 / 1619
» Improvements in Formula Generalization
Sort
View
STOC
1989
ACM
96views Algorithms» more  STOC 1989»
14 years 1 months ago
Optimal Size Integer Division Circuits
Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits of bounded fan-in for integer division  nding reciprocals that...
John H. Reif, Stephen R. Tate
ICC
2007
IEEE
123views Communications» more  ICC 2007»
14 years 3 months ago
Channel Access Statistics of Parallel Multiuser Scheduling
— Generalized selection multiuser diversity (GSMuD) is a new scheduling scheme which provides a near-optimal low-complexity solution to parallel access multiuser scheduling. In t...
Yao Ma, Dongbo Zhang
WCC
2005
Springer
115views Cryptology» more  WCC 2005»
14 years 2 months ago
On the Weights of Binary Irreducible Cyclic Codes
This paper is devoted to the study of the weights of binary irreducible cyclic codes. We start from McEliece’s interpretation of these weights by means of Gauss sums. Firstly, a ...
Yves Aubry, Philippe Langevin
SMA
2008
ACM
154views Solid Modeling» more  SMA 2008»
13 years 9 months ago
Consistent computation of first- and second-order differential quantities for surface meshes
Differential quantities, including normals, curvatures, principal directions, and associated matrices, play a fundamental role in geometric processing and physics-based modeling. ...
Xiangmin Jiao, Hongyuan Zha
JELIA
2010
Springer
13 years 7 months ago
Parametrized Logic Programming
Traditionally, a logic program is built up to reason about atomic first-order formulas. The key idea of parametrized logic programming is that, instead of atomic first-order form...
Ricardo Gonçalves, José Júlio...