Sciweavers

5153 search results - page 290 / 1031
» Introduction to Randomized Algorithms
Sort
View
ICC
2007
IEEE
126views Communications» more  ICC 2007»
15 years 10 months ago
A New Initial Codebook Algorithm for Learning Vector Quantization
—In this paper, a new sorting initial codebook algorithm for learning vector quantization (LVQ) based upon selforganizing feature maps (SOM) has been proposed. The basic idea is ...
Hongsong Li, Baohua Xu
ICAPR
2005
Springer
15 years 9 months ago
The RW2 Algorithm for Exact Graph Matching
The RW algorithm has been proposed recently to solve the exact graph matching problem. This algorithm exploits Random Walk theory to compute a topological signature which can be u...
Marco Gori, Marco Maggini, Lorenzo Sarti
FCCM
2000
IEEE
105views VLSI» more  FCCM 2000»
15 years 8 months ago
A Communication Scheduling Algorithm for Multi-FPGA Systems
For multiple FPGA systems, the limited number of I/O pins causes many problems. To solve these problems, efficient communication scheduling among FPGAs is crucial for obtaining hi...
Jinwoo Suh, Dong-In Kang, Stephen P. Crago
JIRS
2007
108views more  JIRS 2007»
15 years 3 months ago
GODZILA: A Low-resource Algorithm for Path Planning in Unknown Environments
— In this paper, we propose a novel path-planning and obstacle avoidance algorithm GODZILA for navigation in unknown environments. No prior knowledge of the environment is requir...
Prashanth Krishnamurthy, Farshad Khorrami
FOCS
2008
IEEE
15 years 10 months ago
Constant-Time Approximation Algorithms via Local Improvements
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
Huy N. Nguyen, Krzysztof Onak