Sciweavers

29908 search results - page 251 / 5982
» On the Complexity of
Sort
View
157
Voted
TCS
2008
15 years 6 months ago
The computational complexity of the parallel knock-out problem
We consider computational complexity questions related to parallel knock-out schemes for graphs. In such schemes, in each round, each remaining vertex of a given graph eliminates ...
Hajo Broersma, Matthew Johnson 0002, Daniël P...
TIP
2008
146views more  TIP 2008»
15 years 6 months ago
Image Modeling Using Interscale Phase Properties of Complex Wavelet Coefficients
This paper describes an approach to image modelling using interscale phase relationships of wavelet coefficients for use in image estimation applications. The method is based on th...
Mark Miller, Nick G. Kingsbury
JCP
2007
94views more  JCP 2007»
15 years 6 months ago
Low-Complexity Analysis of Repetitive Regularities for Biometric Applications
— Presented in this paper is a joint algorithm optimization and architecture design framework for analysis of repetitive regularities. Two closely coupled algorithm optimization ...
Lei Wang, Niral Patel
AAECC
2004
Springer
83views Algorithms» more  AAECC 2004»
15 years 6 months ago
Bounding the Trellis State Complexity of Algebraic Geometric Codes
Abstract. Let C be an algebraic geometric code of dimension k and length n constructed on a curve X over Fq. Let s(C) be the state complexity of C and set w(C) := min{k, n-k}, the ...
Carlos Munuera, Fernando Torres
TSP
2008
117views more  TSP 2008»
15 years 6 months ago
Asymptotically Efficient Reduced Complexity Frequency Offset and Channel Estimators for Uplink MIMO-OFDMA Systems
In this paper, we address the joint data-aided estimation of frequency offsets and channel coefficients in uplink MIMO-OFDMA systems. As the Maximum Likelihood (ML) estimator is i...
Serdar Sezginer, Pascal Bianchi