Sciweavers

4744 search results - page 115 / 949
» Connected Computing
Sort
View
ENTCS
2008
91views more  ENTCS 2008»
15 years 3 months ago
Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra
Several different uses of Newton's method in connection with the Fundamental Theorem of Algebra are pointed out. Theoretical subdivision schemes have been combined with the n...
Prashant Batra
AML
2006
83views more  AML 2006»
15 years 3 months ago
The Medvedev lattice of computably closed sets
Simpson introduced the lattice P of 0 1 classes under Medvedev reducibility. Questions regarding completeness in P are related to questions about measure and randomness. We presen...
Sebastiaan Terwijn
TJS
2002
101views more  TJS 2002»
15 years 2 months ago
Compilation for Adaptive Computing Systems Using Complex Parameterized Hardware Objects
FLAME, the Flexible API for Module-based Environments, is a proposed standard interface for the integration of parameterized hardware generators into high-level design tools. This ...
Andreas Koch
MOC
2010
14 years 9 months ago
Computation of conformal representations of compact Riemann surfaces
We find a system of two polynomial equations in two unknowns, whose solution allows us to give an explicit expression of the conformal representation of a simply connected three-sh...
Guillermo López Lagomasino, Domingo Pestana...
PDP
2003
IEEE
15 years 8 months ago
QoS-aware Accounting in Mobile Computing Scenarios
The enlarging market of portable devices and wireless networks stimulates the provisioning of mobilityenabled Internet services with differentiated levels of Quality of Service (Q...
Paolo Bellavista, Antonio Corradi, Silvia Vecchi