Sciweavers

1734 search results - page 272 / 347
» Design Patterns for Reconfigurable Computing
Sort
View
DATE
2004
IEEE
119views Hardware» more  DATE 2004»
15 years 6 months ago
MINCE: Matching INstructions Using Combinational Equivalence for Extensible Processor
Designing custom-extensible instructions for Extensible Processors1 is a computationally complex task because of the large design space. The task of automatically matching candida...
Newton Cheung, Sri Parameswaran, Jörg Henkel,...
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
15 years 6 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers
120
Voted
CVPR
2008
IEEE
16 years 4 months ago
Non-refractive modulators for encoding and capturing scene appearance and depth
We analyze the modulation of a light field via nonrefracting attenuators. In the most general case, any desired modulation can be achieved with attenuators having four degrees of ...
Ashok Veeraraghavan, Amit K. Agrawal, Ramesh Raska...
HPCA
2008
IEEE
16 years 2 months ago
Automated microprocessor stressmark generation
Estimating the maximum power and thermal characteristics of a processor is essential for designing its power delivery system, packaging, cooling, and power/thermal management sche...
Ajay M. Joshi, Lieven Eeckhout, Lizy Kurian John, ...
FOCS
2002
IEEE
15 years 7 months ago
Protocols and Impossibility Results for Gossip-Based Communication Mechanisms
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
David Kempe, Jon M. Kleinberg