Sciweavers

1120 search results - page 61 / 224
» Parallel Algorithmic Techniques for Combinatorial Computatio...
Sort
View
124
Voted
IPPS
1998
IEEE
15 years 7 months ago
On Randomized and Deterministic Schemes for Routing and Sorting on Fixed-Connection Networks
Abstract. We give a high-level description of some fundamental randomized and deterministic techniques for routing and sorting on xedconnection networks such as meshes, hypercubes ...
Torsten Suel
CCGRID
2002
IEEE
15 years 8 months ago
Towards Trust-Aware Resource Management in Grid Computing Systems
Resource management is a central part of a Grid computing system. In a large-scale wide-area system such as the Grid, security is a prime concern. One approach is to be conservati...
Farag Azzedin, Muthucumaru Maheswaran
138
Voted
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
15 years 3 months ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
Heikki Hyyrö, Gonzalo Navarro
133
Voted
IPPS
2006
IEEE
15 years 9 months ago
Reducing reconfiguration time of reconfigurable computing systems in integrated temporal partitioning and physical design framew
In reconfigurable systems, reconfiguration latency is a very important factor impact the system performance. In this paper, a framework is proposed that integrates the temporal pa...
Farhad Mehdipour, Morteza Saheb Zamani, H. R. Ahma...
120
Voted
ICIP
2000
IEEE
16 years 5 months ago
Fast Code Enhancement with Local Search for Fractal Image Compression
Optimal fractal coding consists of finding in a finite set of contractive affine mappings one whose unique fixed point is closest to the original image. Optimal fractal coding is ...
Raouf Hamzaoui, Dietmar Saupe, Michael Hiller