Sciweavers

377 search results - page 53 / 76
» A Fast Heuristic Algorithm for a Probe Mapping Problem
Sort
View
ICPP
2005
IEEE
14 years 2 months ago
Filter Decomposition for Supporting Coarse-Grained Pipelined Parallelism
We consider the filter decomposition problem in supporting coarse-grained pipelined parallelism. This form of parallelism is suitable for data-driven applications in scenarios wh...
Wei Du, Gagan Agrawal
DAC
2004
ACM
14 years 9 months ago
Data compression for improving SPM behavior
Scratch-pad memories (SPMs) enable fast access to time-critical data. While prior research studied both static and dynamic SPM management strategies, not being able to keep all ho...
Ozcan Ozturk, Mahmut T. Kandemir, I. Demirkiran, G...
FUIN
2008
112views more  FUIN 2008»
13 years 8 months ago
A New Probabilistic Approach for Fractal Based Image Compression
Abstract. Approximation of an image by the attractor evolved through iterations of a set of contractive maps is usually known as fractal image compression. The set of maps is calle...
Suman K. Mitra, Malay Kumar Kundu, C. A. Murthy, B...
AI
2002
Springer
13 years 8 months ago
Algorithm for optimal winner determination in combinatorial auctions
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
Tuomas Sandholm
CSB
2003
IEEE
121views Bioinformatics» more  CSB 2003»
14 years 1 months ago
Epitope Prediction Algorithms for Peptide based Vaccine Design
Peptide-based vaccines, in which small peptides derived from target proteins (epitopes) are used to provoke an immune reaction, have attracted considerable attention recently as a...
Liliana Florea, Bjarni V. Halldórsson, Oliv...