Sciweavers

483 search results - page 64 / 97
» Timing Games and Shared Memory
Sort
View
ICUMT
2009
13 years 7 months ago
A smart access point solution for heterogeneous flows
Abstract--Computer-centered services and broadband wireless connectivity are enabling the delivery of multimedia-based entertainment from the Internet to in-house wireless devices ...
Claudio E. Palazzi, Nicola Stievano, Marco Roccett...
ICPP
2009
IEEE
13 years 7 months ago
A Parallel Algorithm for Computing Betweenness Centrality
In this paper we present a multi-grained parallel algorithm for computing betweenness centrality, which is extensively used in large-scale network analysis. Our method is based on ...
Guangming Tan, Dengbiao Tu, Ninghui Sun
JCPHY
2011
192views more  JCPHY 2011»
13 years 23 days ago
Fast analysis of molecular dynamics trajectories with graphics processing units - Radial distribution function histogramming
The calculation of radial distribution functions (RDFs) from molecular dynamics trajectory data is a common and computationally expensive analysis task. The rate limiting step in ...
Benjamin G. Levine, John E. Stone, Axel Kohlmeyer
ICTAI
2008
IEEE
14 years 4 months ago
The Performance of Approximating Ordinary Differential Equations by Neural Nets
—The dynamics of many systems are described by ordinary differential equations (ODE). Solving ODEs with standard methods (i.e. numerical integration) needs a high amount of compu...
Josef Fojdl, Rüdiger W. Brause
SPAA
1997
ACM
14 years 2 months ago
Accessing Nearby Copies of Replicated Objects in a Distributed Environment
Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as e ...
C. Greg Plaxton, Rajmohan Rajaraman, Andréa...