Sciweavers

2632 search results - page 73 / 527
» On the degree of MIMO systems
Sort
View
SEMCO
2008
IEEE
16 years 17 days ago
Mediatability: Estimating the Degree of Human Involvement in XML Schema Mediation
Mediation and integration of data are significant challenges because the number of services on the Web, and heterogeneities in their data representation, continue to increase rap...
Karthik Gomadam, Ajith Ranabahu, Lakshmish Ramaswa...
ICDCN
2011
Springer
14 years 9 months ago
Deterministic Dominating Set Construction in Networks with Bounded Degree
This paper considers the problem of calculating dominating sets in networks with bounded degree. In these networks, the maximal degree of any node is bounded by Δ, which is usuall...
Roy Friedman, Alex Kogan
ISCAS
2006
IEEE
99views Hardware» more  ISCAS 2006»
16 years 6 days ago
MIMO interconnects order reductions by using the global Arnoldi algorithm
— We propose the global Arnoldi algorithm for MIMO RLCG interconnect model order reductions. This algorithm is an extension of the standard Arnoldi algorithm for systems with mul...
Ming-Hong Lai, Chia-Chi Chu, Wu-Shiung Feng
DM
2008
85views more  DM 2008»
15 years 6 months ago
All graphs with maximum degree three whose complements have 4-cycle decompositions
Let G be the set that contains precisely the graphs on n vertices with maximum degree 3 for which there exists a 4-cycle system of their complement in Kn. In this paper G is compl...
Chin-Mei Fu, Hung-Lin Fu, Christopher A. Rodger, T...
JCT
2008
83views more  JCT 2008»
15 years 6 months ago
Bounds on degrees of p-adic separating polynomials
We study a discrete optimization problem introduced by Babai, Frankl, Kutin, and Stefankovic (2001), which provides bounds on degrees of polynomials with p-adically controlled beh...
Daniel J. Katz, Joshua Zahl