779 search results - page 130 / 156 » A graph polynomial for independent sets of bipartite graphs |
ICDM
2008
IEEE
14 years 1 months ago
2008
IEEE
In this work, we study the problem of within-network relational learning and inference, where models are learned on a partially labeled relational dataset and then are applied to ...
WDAG
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
WEA
2007
Springer
14 years 1 months ago
2007
Springer
For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with equally sized boxes [8, 9, 11, 12]. In this paper ...
ASPDAC
2006
ACM
14 years 1 months ago
2006
ACM
- 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...
FUN
2007
Springer
13 years 11 months ago
2007
Springer
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 ...