Sciweavers

1221 search results - page 193 / 245
» Balanced graph partitioning
Sort
View
ICPR
2010
IEEE
14 years 13 days ago
Finding Multiple Object Instances with Occlusion
In this paper we provide a framework of detection and localization of multiple similar shapes or object instances from an image based on shape matching. There are three challenges...
Ge Guo, Tingting Jiang, Yizhou Wang, Wen Gao
IPPS
1998
IEEE
13 years 12 months ago
Multiprocessor Architectures Using Multi-Hop Multi-OPS Lightwave Networks and Distributed Control
Advances in optical technology have increased the interest for multiprocessor architectures based on lightwave networks because of the vast bandwidth available. In this paper we p...
David Coudert, Afonso Ferreira, Xavier Muño...
DAC
1989
ACM
13 years 11 months ago
Scheduling and Binding Algorithms for High-Level Synthesis
- New algorithms for high-level synthesis are presented. The first performs scheduling under hardware resource constraints and improves on commonly used list scheduling techniques ...
Pierre G. Paulin, John P. Knight
FUN
2007
Springer
80views Algorithms» more  FUN 2007»
13 years 11 months ago
The Traveling Beams Optical Solutions for Bounded NP-Complete Problems
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
Shlomi Dolev, Hen Fitoussi
ASPDAC
2004
ACM
113views Hardware» more  ASPDAC 2004»
13 years 11 months ago
Area-minimal algorithm for LUT-based FPGA technology mapping with duplication-free restriction
- Minimum area is one of the important objectives in technology mapping for lookup table-based FPGAs. It has been proven that the problem is NP-complete. This paper presents a poly...
Chi-Chou Kao, Yen-Tai Lai