Sciweavers

2814 search results - page 341 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
INFOCOM
2011
IEEE
13 years 2 months ago
On the achievable throughput of CSMA under imperfect carrier sensing
Abstract—Recently, it has been shown that a simple, distributed CSMA algorithm is throughput-optimal. However, throughput-optimality is established under the perfect or ideal car...
Tae Hyun Kim 0001, Jian Ni, R. Srikant, Nitin H. V...
IPPS
2006
IEEE
14 years 4 months ago
Parallel morphological processing of hyperspectral image data on heterogeneous networks of computers
Recent advances in space and computer technologies are revolutionizing the way remotely sensed data is collected, managed and interpreted. The development of efficient techniques ...
Antonio J. Plaza
SC
2005
ACM
14 years 4 months ago
SPICE: Simulated Pore Interactive Computing Environment
— SPICE aims to understand the vital process of translocation of biomolecules across protein pores by computing the free energy profile of the translocating biomolecule along th...
Shantenu Jha, Peter V. Coveney, Matt J. Harvey
ICDCS
2010
IEEE
14 years 2 months ago
Quantifying and Querying Network Reachability
—Quantifying and querying network reachability is important for security monitoring and auditing as well as many aspects of network management such as troubleshooting, maintenanc...
Amir R. Khakpour, Alex X. Liu
CASCON
1992
134views Education» more  CASCON 1992»
13 years 12 months ago
Cluster busting in anchored graph drawing
Given a graph G and a drawing or layout of G, it is sometimes desirable to alter or adjust the layout. The challenging aspect of designing layout adjustment algorithms is to maint...
Kelly A. Lyons