Sciweavers

2609 search results - page 445 / 522
» Optimizing for parallelism and data locality
Sort
View
82
Voted
TIP
2010
90views more  TIP 2010»
14 years 7 months ago
Fast Query for Exemplar-Based Image Completion
In this paper, we present a fast algorithm for filling unknown regions in an image using the strategy of exemplarmatching. Unlike the original exemplar-based method using exhaustiv...
Tsz-Ho Kwok, Hoi Sheung, Charlie C. L. Wang
ICDCS
2009
IEEE
15 years 9 months ago
Roadcast: A Popularity Aware Content Sharing Scheme in VANETs
Content sharing through vehicle-to-vehicle communication can help people find their interested content on the road. In VANETs, due to limited contact duration and unreliable wire...
Yang Zhang, Jing Zhao, Guohong Cao
ICS
2009
Tsinghua U.
15 years 7 months ago
/scratch as a cache: rethinking HPC center scratch storage
To sustain emerging data-intensive scientific applications, High Performance Computing (HPC) centers invest a notable fraction of their operating budget on a specialized fast sto...
Henry M. Monti, Ali Raza Butt, Sudharshan S. Vazhk...
VIS
2004
IEEE
136views Visualization» more  VIS 2004»
16 years 1 months ago
Visibility Culling for Time-Varying Volume Rendering Using Temporal Occlusion Coherence
Typically there is a high coherence in data values between neighboring time steps in an iterative scientific software simulation; this characteristic similarly contributes to a co...
Jinzhu Gao, Han-Wei Shen, Jian Huang, James Arthur...
95
Voted
CCGRID
2008
IEEE
15 years 7 months ago
A Stable Broadcast Algorithm
—Distributing large data to many nodes, known as a broadcast or a multicast, is an important operation in parallel and distributed computing. Most previous broadcast algorithms e...
Kei Takahashi, Hideo Saito, Takeshi Shibata, Kenji...