Sciweavers

10608 search results - page 555 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
STOC
1989
ACM
96views Algorithms» more  STOC 1989»
15 years 11 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
DCC
2004
IEEE
15 years 10 months ago
Model Based Optimal Bit Allocation
Modeling of the operational rate-distortion characteristics of a signal can significantly reduce the computational complexity of an optimal bit allocation algorithm. In this repor...
Nasir Rajpoot
ESA
2006
Springer
147views Algorithms» more  ESA 2006»
15 years 10 months ago
Univariate Polynomial Real Root Isolation: Continued Fractions Revisited
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algeb...
Elias P. Tsigaridas, Ioannis Z. Emiris
AEI
1999
86views more  AEI 1999»
15 years 6 months ago
A factorisation model of robotic tasks
The implantation of programs which gives a robot the ability to perform a non-repetitive task (task not completely de
Salima Benbernou
SASO
2010
IEEE
15 years 5 months ago
Extracting Overlay Invariants of Distributed Systems for Autonomic System Management
Many large-scale distributed systems have been built with great complexity to run Internet services. Due to the heterogeneity and dynamics of complex systems, it is very difficult ...
Hanhuai Shan, Guofei Jiang, Kenji Yoshihira