Sciweavers

19700 search results - page 44 / 3940
» DNA-Based Computation Times
Sort
View
ISCC
2002
IEEE
131views Communications» more  ISCC 2002»
14 years 2 months ago
Scheduling real time parallel structure on cluster computing
: - Efficient task scheduling is essential for achieving high performance computing applications for distributed systems. Most of existing real-time systems consider schedulability...
Reda A. Ammar, Abdulrahman Alhamdan
ISSADS
2005
Springer
14 years 3 months ago
Database System Architecture - A Walk Through Time: From Centralized Platform to Mobile Computing - Keynote Address
Classical distributed database systems monolithically offer distribution transparency and higher performance. This is made possible by making data available and closer to the appl...
Ali R. Hurson, Yu Jiao
SENSYS
2004
ACM
14 years 3 months ago
Power - time optimal algorithm for computing FFT over sensor networks
bstract: Power - Time Optimal Algorithm for Computing FFT over Sensor Networks Categories and Subject Descriptors C.2.1 [Network Architecture and Design] Wireless Communication, Di...
Turkmen Canli, Mark Terwilliger, Ajay K. Gupta, As...
FOSSACS
2004
Springer
14 years 3 months ago
Soft lambda-Calculus: A Language for Polynomial Time Computation
Soft linear logic ([Lafont02]) is a subsystem of linear logic characterizing the class PTIME. We introduce Soft lambda-calculus as a calculus typable in the intuitionistic and affi...
Patrick Baillot, Virgile Mogbil
DGCI
2009
Springer
14 years 1 months ago
Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour
The Minimum Length Polygon (MLP) is an interesting first order approximation of a digital contour. For instance, the convexity of the MLP is characteristic of the digital convexit...
Xavier Provençal, Jacques-Olivier Lachaud