Sciweavers

951 search results - page 35 / 191
» On the Computation of Correctly-Rounded Sums
Sort
View
ICPP
1995
IEEE
15 years 1 months ago
Sorting and Selection on Distributed Memory Bus Computers
In this paper we study the problems of sorting and selection on the Distributed Memory Bus Computer (DMBC) recently introduced by Sahni. In particular we present: 1) An efficient a...
Sanguthevar Rajasekaran, Sartaj Sahni
IPPS
2003
IEEE
15 years 3 months ago
A Hierarchical Model for Distributed Collaborative Computation in Wireless Sensor Networks
Clustering is an important characteristic of most sensor applications. In this paper we define COSMOS, the Cluster-based, heterOgeneouS MOdel for Sensor networks. The model assum...
Mitali Singh, Viktor K. Prasanna
CPM
1994
Springer
123views Combinatorics» more  CPM 1994»
15 years 2 months ago
Computing all Suboptimal Alignments in Linear Space
Recently, a new compact representation for suboptimal alignments was proposed by Naor and Brutlag (1993). The kernel of that representation is a minimal directed acyclic graph (DAG...
Kun-Mao Chao
RTA
2010
Springer
15 years 2 months ago
Closing the Gap Between Runtime Complexity and Polytime Computability
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...
Martin Avanzini, Georg Moser
PCI
2005
Springer
15 years 3 months ago
Middleware for Building Ubiquitous Computing Applications Using Distributed Objects
Ubiquitous systems are characterized by multi-fold complexity, stemming mainly from the vast number of possible interactions between many heterogeneous objects and services. Device...
Nicolas Drossos, Eleni Christopoulou, Achilles Kam...