Sciweavers

1477 search results - page 21 / 296
» Complexity of (iterated) dominance
Sort
View
CGF
2006
191views more  CGF 2006»
15 years 6 months ago
A Robust Two-Step Procedure for Quad-Dominant Remeshing
We propose a new technique for quad-dominant remeshing which separates the local regularity requirements from the global alignment requirements by working in two steps. In the fir...
Martin Marinov, Leif Kobbelt
ICCD
2004
IEEE
135views Hardware» more  ICCD 2004»
16 years 3 months ago
Design Methodologies and Architecture Solutions for High-Performance Interconnects
In Deep Sub-Micron (DSM) technologies, interconnects play a crucial role in the correct functionality and largely impact the performance of complex System-on-Chip (SoC) designs. F...
Davide Pandini, Cristiano Forzan, Livio Baldi
TAMC
2009
Springer
16 years 18 days ago
On Parameterized Exponential Time Complexity
In this paper we define the notion of an f(k)-uniform parameterized exponential time scheme. We show that a problem can be solved in parameterized O(2o(f(k)) p(n)) time if and on...
Jianer Chen, Iyad A. Kanj, Ge Xia
GLOBECOM
2007
IEEE
16 years 12 days ago
Time-Varying Channel Complex Gains Estimation and ICI Suppression in OFDM Systems
—In this paper, we present an iterative algorithm for channel complex gains estimation with inter-sub-carrierinterference (ICI) reduction in orthogonal-frequency-divisionmultiple...
Hussein Hijazi, Laurent Ros
GECCO
2007
Springer
135views Optimization» more  GECCO 2007»
16 years 7 days ago
A cumulative evidential stopping criterion for multiobjective optimization evolutionary algorithms
In this work we present a novel and efficient algorithm– independent stopping criterion, called the MGBM criterion, suitable for Multiobjective Optimization Evolutionary Algorit...
Luis Martí, Jesús García, Ant...