Sciweavers

5448 search results - page 339 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
IPPS
1999
IEEE
15 years 11 months ago
An Efficient Implementation Method of Fractal Image Compression on Dynamically Reconfigurable Architecture
Abstract. This paper proposes a method for implementing fractal image compression on dynamically reconfigurable architecture. In the encoding of this compression, metric computatio...
Hidehisa Nagano, Akihiro Matsuura, Akira Nagoya
PPAM
2005
Springer
16 years 5 days ago
Chromatic Scheduling of 1- and 2-Processor UET Tasks on Dedicated Machines with Availability Constraints
We address a generalization of the classical 1- and 2-processor UET scheduling problem on dedicated machines. In our chromatic model of scheduling machines have non-simultaneous av...
Krzysztof Giaro, Marek Kubale
HIPC
1999
Springer
15 years 11 months ago
Memory-Optimal Evaluation of Expression Trees Involving Large Objects
The need to evaluate expression trees involving large objects arises in scientific computing applications such as electronic structure calculations. Often, the tree node objects a...
Chi-Chung Lam, Daniel Cociorva, Gerald Baumgartner...
CACM
1999
92views more  CACM 1999»
15 years 6 months ago
Putting OO Distributed Programming to Work
stractions underlying distributed computing. We attempted to keep our preaims at an abstract and general level. In this column, we make those claims more concrete. More precisely, ...
Pascal Felber, Rachid Guerraoui, Mohamed Fayad
WWW
2010
ACM
16 years 1 months ago
Mind the data skew: distributed inferencing by speeddating in elastic regions
Semantic Web data exhibits very skewed frequency distributions among terms. Efficient large-scale distributed reasoning methods should maintain load-balance in the face of such hi...
Spyros Kotoulas, Eyal Oren, Frank van Harmelen