Sciweavers

2766 search results - page 306 / 554
» Algorithms for trigonometric polynomials
Sort
View
CORR
2008
Springer
115views Education» more  CORR 2008»
15 years 5 months ago
Adaptive Sum Power Iterative Waterfilling for MIMO Cognitive Radio Channels
Abstract--In this paper, the sum capacity of the Gaussian Multiple Input Multiple Output (MIMO) Cognitive Radio Channel (MCC) is expressed as a convex problem with finite number of...
Rajiv Soundararajan, Sriram Vishwanath
DAM
2006
191views more  DAM 2006»
15 years 5 months ago
Approximating the minimum clique cover and other hard problems in subtree filament graphs
Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament graphs, chordal graphs,...
J. Mark Keil, Lorna Stewart
TCAD
2002
93views more  TCAD 2002»
15 years 4 months ago
Hierarchical buffered routing tree generation
Abstract--This paper presents a solution to the problem of performance-driven buffered routing tree generation for VLSI circuits. Using a novel bottom-up construction algorithm and...
Amir H. Salek, Jinan Lou, Massoud Pedram
170
Voted
EC
2008
153views ECommerce» more  EC 2008»
15 years 4 months ago
On Complexity of Optimal Recombination for Binary Representations of Solutions
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
Anton V. Eremeev
OTM
2010
Springer
15 years 3 months ago
Identifying and Eliminating Inconsistencies in Mappings across Hierarchical Ontologies
Abstract. Many applications require the establishment of mappings between ontologies. Such mappings are established by domain experts or automated tools. Errors in mappings can int...
Bhavesh Sanghvi, Neeraj Koul, Vasant Honavar