Sciweavers

811 search results - page 119 / 163
» An efficient algorithm for the configuration problem of domi...
Sort
View
JCB
2006
115views more  JCB 2006»
13 years 8 months ago
Designing an A* Algorithm for Calculating Edit Distance between Rooted-Unordered Trees
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
Yair Horesh, Ramit Mehr, Ron Unger
VLSISP
2008
100views more  VLSISP 2008»
13 years 8 months ago
Memory-constrained Block Processing for DSP Software Optimization
Digital signal processing (DSP) applications involve processing long streams of input data. It is important to take into account this form of processing when implementing embedded ...
Ming-Yung Ko, Chung-Ching Shen, Shuvra S. Bhattach...
IJCAI
1989
13 years 10 months ago
Reasoning about Kinematic Topology
t ion which is much more abstract than a place vocabulary, the kinematic topology. Kinematic topology does not define qualitative inference rules, but provides a characterization o...
Boi Faltings, Emmanuel Baechler, J. Primus
ASPDAC
2006
ACM
116views Hardware» more  ASPDAC 2006»
14 years 2 months ago
Post-routing redundant via insertion for yield/reliability improvement
- Reducing the yield loss due to via failure is one of the important problems in design for manufacturability. A well known and highly recommended method to improve via yield/relia...
Kuang-Yao Lee, Ting-Chi Wang
DAM
2002
135views more  DAM 2002»
13 years 8 months ago
Matchings in colored bipartite networks
In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n - r) blue e...
Tongnyoul Yi, Katta G. Murty, Cosimo Spera