Sciweavers

575 search results - page 39 / 115
» Computing Maximum Subsequence in Parallel
Sort
View
ICDCS
1999
IEEE
13 years 12 months ago
Scalable Processing of Read-Only Transactions in Broadcast Push
Recently, push-based delivery has attracted considerable attention as a means of disseminating information to large client populations in both wired and wireless settings. In this...
Evaggelia Pitoura, Panos K. Chrysanthis
DNA
2008
Springer
121views Bioinformatics» more  DNA 2008»
13 years 9 months ago
Isothermal Reactivating Whiplash PCR for Locally Programmable Molecular Computation
Whiplash PCR (WPCR), due to Hagiya et al. [1], is a novel technique for autonomous molecular computation where a state machine is implemented with a single stranded DNA molecule a...
John H. Reif, Urmi Majumder
IPPS
2005
IEEE
14 years 1 months ago
Maximizing the Lifetime of Dominating Sets
We investigate the problem of maximizing the lifetime of wireless ad hoc and sensor networks. Being battery powered, nodes in such networks have to perform their intended task und...
Thomas Moscibroda, Roger Wattenhofer
ICPP
2000
IEEE
14 years 19 hour ago
Multilayer VLSI Layout for Interconnection Networks
Current VLSI technology allows more than two wiring layers and the number is expected to rise in future. In this paper, we show that, by designing VLSI layouts directly for an L-l...
Chi-Hsiang Yeh, Emmanouel A. Varvarigos, Behrooz P...
IPPS
1999
IEEE
13 years 12 months ago
Lower Bounds on the Loading of Degree-2 Multiple Bus Networks for Binary-Tree Algorithms
A binary-tree algorithm, Bin(n), proceeds level-bylevel from the leaves of a 2n -leaf balanced binary tree to its root. This paper deals with running binary-tree algorithms on mul...
Hettihe P. Dharmasena, Ramachandran Vaidyanathan