Sciweavers

2766 search results - page 308 / 554
» Algorithms for trigonometric polynomials
Sort
View
SODA
2012
ACM
253views Algorithms» more  SODA 2012»
13 years 7 months ago
Kernelization of packing problems
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
Holger Dell, Dániel Marx
CVPR
2008
IEEE
16 years 7 months ago
Least squares surface reconstruction from measured gradient fields
This paper presents a new method for the reconstruction of a surface from its ? and ? gradient field, measured, for example, via Photometric Stereo. The new algorithm produces the...
Matthew Harker, Paul O'Leary
ICDE
2010
IEEE
227views Database» more  ICDE 2010»
16 years 4 months ago
Approximate Confidence Computation in Probabilistic Databases
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
Dan Olteanu, Jiewen Huang, Christoph Koch
STACS
2010
Springer
15 years 12 months ago
Dispersion in Unit Disks
We present two new approximation algorithms with (improved) constant ratios for selecting n points in n unit disks such that the minimum pairwise distance among the points is maxi...
Adrian Dumitrescu, Minghui Jiang
DATE
2009
IEEE
133views Hardware» more  DATE 2009»
15 years 11 months ago
Energy efficient multiprocessor task scheduling under input-dependent variation
— In this paper, we propose a novel, energy aware scheduling algorithm for applications running on DVS-enabled multiprocessor systems, which exploits variation in execution times...
Jason Cong, Karthik Gururaj