Sciweavers

409 search results - page 38 / 82
» Polynomial Time Approximation Schemes and Parameterized Comp...
Sort
View
VTC
2007
IEEE
154views Communications» more  VTC 2007»
15 years 3 months ago
An Improved Peak-to-Average Power Ratio Estimation Scheme for OFDM Systems
—To approximate the exact peaks of continuous-time orthogonal frequency division multiplexing (OFDM) signals, four times oversampling is usually employed for discrete-time OFDM s...
Chin-Liang Wang, Sheng-Ju Ku, Chun-Ju Yang
STACS
2004
Springer
15 years 3 months ago
On Minimum Circular Arrangement
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
Murali K. Ganapathy, Sachin Lodha
75
Voted
CPM
2000
Springer
136views Combinatorics» more  CPM 2000»
15 years 2 months ago
Approximating the Maximum Isomorphic Agreement Subtree Is Hard
The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phyl...
Paola Bonizzoni, Gianluca Della Vedova, Giancarlo ...
IJCV
2000
230views more  IJCV 2000»
14 years 9 months ago
Design and Use of Linear Models for Image Motion Analysis
Linear parameterized models of optical flow, particularly affine models, have become widespread in image motion analysis. The linear model coefficients are straightforward to estim...
David J. Fleet, Michael J. Black, Yaser Yacoob, Al...
ICALP
1998
Springer
15 years 1 months ago
Efficient Approximation Algorithms for the Subset-Sums Equality Problem
We investigate the problem of finding two nonempty disjoint subsets of a set of n positive integers, with the objective that the sums of the numbers in the two subsets be as close ...
Cristina Bazgan, Miklos Santha, Zsolt Tuza