Sciweavers

5005 search results - page 88 / 1001
» The Design and Analysis of Parallel Algorithms
Sort
View
IPPS
2007
IEEE
15 years 7 months ago
Network-Oblivious Algorithms
The design of algorithms that can run unchanged yet efficiently on a variety of machines characterized by different degrees of parallelism and communication capabilities is a hig...
Gianfranco Bilardi, Andrea Pietracaprina, Geppino ...
86
Voted
DCOSS
2005
Springer
15 years 6 months ago
Design and Analysis of Wave Sensing Scheduling Protocols for Object-Tracking Applications
Abstract. Many sensor network applications demand tightly-bounded object detection quality. To meet such stringent requirements, we develop three sensing scheduling protocols to gu...
Shansi Ren, Qun Li, Haining Wang, Xiaodong Zhang
CORR
2008
Springer
132views Education» more  CORR 2008»
15 years 21 days ago
Betweenness Centrality : Algorithms and Lower Bounds
One of the most fundamental problems in large-scale network analysis is to determine the importance of a particular node in a network. Betweenness centrality is the most widely us...
Shiva Kintali
ARTS
1999
Springer
15 years 4 months ago
Quantitative Program Logic and Performance in Probabilistic Distributed Algorithms
In this paper we show how quantitative program logic [14] provides a formal framework in which to promote standard techniques of program analysis to a context where probability and...
Annabelle McIver
CF
2009
ACM
15 years 7 months ago
Quantitative analysis of sequence alignment applications on multiprocessor architectures
The exponential growth of databases that contains biological information (such as protein and DNA data) demands great efforts to improve the performance of computational platforms...
Friman Sánchez, Alex Ramírez, Mateo ...