Sciweavers

2957 search results - page 107 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
IPL
2010
114views more  IPL 2010»
13 years 8 months ago
Alphabetic coding with exponential costs
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
Michael B. Baer
PVLDB
2010
97views more  PVLDB 2010»
13 years 8 months ago
Ranking Continuous Probabilistic Datasets
Ranking is a fundamental operation in data analysis and decision support, and plays an even more crucial role if the dataset being explored exhibits uncertainty. This has led to m...
Jian Li, Amol Deshpande
TCSV
2002
88views more  TCSV 2002»
13 years 9 months ago
Variable complexity DCT approximations driven by an HVQ-based analyzer
Transform approximations are explored for speeding up the software compression of images and video. Approximations are used to replace the regular discrete cosine transform (DCT) w...
Ricardo L. de Queiroz
JAT
2010
171views more  JAT 2010»
13 years 4 months ago
Chebyshev approximation of the null function by an affine combination of complex exponential functions
We describe the theoretical solution of an approximation problem that uses a finite weighted sum of complex exponential functions. The problem arises in an optimization model for t...
Paul Armand, Joël Benoist, Elsa Bousquet
ISAAC
2005
Springer
81views Algorithms» more  ISAAC 2005»
14 years 3 months ago
Complexity and Approximation of the Minimum Recombination Haplotype Configuration Problem
We study the complexity and approximation of the problem of reconstructing haplotypes from genotypes on pedigrees under the Mendelian Law of Inheritance and the minimum recombinant...
Lan Liu, Xi Chen, Jing Xiao, Tao Jiang