Sciweavers

10805 search results - page 1995 / 2161
» Mapping Computation with No Memory
Sort
View
SIAMSC
2008
129views more  SIAMSC 2008»
15 years 4 months ago
Bottom-Up Construction and 2: 1 Balance Refinement of Linear Octrees in Parallel
Abstract. In this article, we propose new parallel algorithms for the construction and 2:1 balance refinement of large linear octrees on distributed memory machines. Such octrees a...
Hari Sundar, Rahul S. Sampath, George Biros
TDSC
2008
102views more  TDSC 2008»
15 years 4 months ago
Temporal Partitioning of Communication Resources in an Integrated Architecture
Integrated architectures in the automotive and avionic domain promise improved resource utilization and enable a better coordination of application subsystems compared to federated...
Roman Obermaisser
CG
2005
Springer
15 years 4 months ago
Adaptive density estimation using an orthogonal series for global illumination
In Monte-Carlo photon-tracing methods energy-carrying particles are traced in an environment to generate hit points on object surfaces for simulating global illumination. The surf...
Kam Wah Wong, Wenping Wang
TSP
2008
179views more  TSP 2008»
15 years 4 months ago
Estimation in Gaussian Graphical Models Using Tractable Subgraphs: A Walk-Sum Analysis
Graphical models provide a powerful formalism for statistical signal processing. Due to their sophisticated modeling capabilities, they have found applications in a variety of fie...
V. Chandrasekaran, Jason K. Johnson, Alan S. Wills...
142
Voted
JACM
2000
77views more  JACM 2000»
15 years 3 months ago
The fault span of crash failures
A crashing network protocol is an asynchronous protocol whose memory does not survive crashes. We show that a crashing network protocol that works over unreliable links can be driv...
George Varghese, Mahesh Jayaram
« Prev « First page 1995 / 2161 Last » Next »