Sciweavers

6740 search results - page 105 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
ICCAD
2006
IEEE
117views Hardware» more  ICCAD 2006»
14 years 7 months ago
Post-routing redundant via insertion and line end extension with via density consideration
- Redundant via insertion and line end extension employed in the post-routing stage are two well known and highly recommended techniques to reduce yield loss due to via failure. Ho...
Kuang-Yao Lee, Ting-Chi Wang, Kai-Yuan Chao
STRINGOLOGY
2008
13 years 11 months ago
Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
Pawel Baturo, Marcin Piatkowski, Wojciech Rytter
GLVLSI
2009
IEEE
159views VLSI» more  GLVLSI 2009»
14 years 4 months ago
On the complexity of graph cuboidal dual problems for 3-D floorplanning of integrated circuit design
This paper discusses the impact of migrating from 2-D to 3-D on floorplanning and placement. By looking at a basic formulation of graph cuboidal dual problem, we show that the 3-...
Renshen Wang, Chung-Kuan Cheng
IWANN
2007
Springer
14 years 4 months ago
A Comparison Between ANN Generation and Training Methods and Their Development by Means of Graph Evolution: 2 Sample Problems
Abstract. This paper presents a study in which a new technique for automatically developing Artificial Neural Networks (ANNs) by means of Evolutionary Computation (EC) tools is com...
Daniel Rivero, Julian Dorado, Juan R. Rabuñ...
ICCV
2007
IEEE
15 years 3 days ago
A Robust Graph-Based Method for The General Correspondence Problem Demonstrated on Image Stitching
We pose robust matching with parametric and non-parametric constraints as the problem of finding a stable independent set (SIS) in an oriented graph whose vertices are all possible...
Martin Bujnak, Radim Sára