Sciweavers

2450 search results - page 416 / 490
» Time Mapping with Hypergraphs
Sort
View
CASES
2010
ACM
14 years 7 months ago
Instruction selection by graph transformation
Common generated instruction selections are based on tree pattern matching, but modern and custom architectures feature instructions, which cannot be covered by trees. To overcome...
Sebastian Buchwald, Andreas Zwinkau
ICASSP
2010
IEEE
14 years 7 months ago
A distributed psycho-visually motivated Canny edge detector
This paper proposes a distributed Canny edge detection algorithm which can be mapped onto multi-core architectures for high throughput applications. In contrast to the conventiona...
Srenivas Varadarajan, Chaitali Chakrabarti, Lina J...
IPPS
2010
IEEE
14 years 7 months ago
Large neighborhood local search optimization on graphics processing units
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
Thé Van Luong, Nouredine Melab, El-Ghazali ...
IPPS
2010
IEEE
14 years 7 months ago
Executing task graphs using work-stealing
Abstract--NABBIT is a work-stealing library for execution of task graphs with arbitrary dependencies which is implemented as a library for the multithreaded programming language Ci...
Kunal Agrawal, Charles E. Leiserson, Jim Sukha
WD
2010
14 years 7 months ago
Vicinity resource cartography for delay-tolerant networks: A holistic perspective
In this paper we propose a distributed approach to construct vicinity resource maps at each node in a delaytolerant network. The scheme uses recent encounters to estimate the avail...
Gabriel Sandulescu, Péter Schaffer, Simin N...