Sciweavers

7557 search results - page 452 / 1512
» Constraints as a design pattern
Sort
View
JSA
2008
124views more  JSA 2008»
15 years 7 months ago
Processor array architectures for flexible approximate string matching
In this paper, we present linear processor array architectures for flexible approximate string matching. These architectures are based on parallel realization of dynamic programmi...
Panagiotis D. Michailidis, Konstantinos G. Margari...
DAC
2007
ACM
16 years 8 months ago
An Integer Linear Programming Based Routing Algorithm for Flip-Chip Design
The flip-chip package provides a high chip-density solution to the demand for more I/O pads of VLSI designs. In this paper, we present the first routing algorithm in the literatur...
Jia-Wei Fang, Chin-Hsiung Hsu, Yao-Wen Chang
WWW
2007
ACM
16 years 7 months ago
XML design for relational storage
Design principles for XML schemas that eliminate redundancies and avoid update anomalies have been studied recently. Several normal forms, generalizing those for relational databa...
Solmaz Kolahi, Leonid Libkin
FOCS
2008
IEEE
16 years 1 months ago
Degree Bounded Network Design with Metric Costs
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Ko...
ICC
2007
IEEE
110views Communications» more  ICC 2007»
16 years 1 months ago
A New STC Structure to Achieve Generalized Optimal Diversity with a Reduced Design Complexity
Abstract - We propose a new space-time code (STC) structure that can achieve generalized optimal diversity (GOD) with a reduced design complexity, and also provide an increased cod...
Moon Il Lee, Seong Keun Oh, Dong Seung Kwon