Sciweavers

692 search results - page 28 / 139
» BDD minimization for approximate computing
Sort
View
INFOCOM
2009
IEEE
15 years 5 months ago
Delay-Optimal Opportunistic Scheduling and Approximations: The Log Rule
—This paper considers the design of opportunistic packet schedulers for users sharing a time-varying wireless channel from the performance and the robustness points of view. Firs...
Bilal Sadiq, Seung Jun Baek, Gustavo de Veciana
ICPR
2006
IEEE
15 years 11 months ago
Approximation of Digital Curves using a Multi-Objective Genetic Algorithm
In this paper, a digital planar curve approximation method based on a multi-objective genetic algorithm is proposed. In this method, the optimization/exploration algorithm locates...
Hervé Locteau, Romain Raveaux, Sébas...
FOCS
2005
IEEE
15 years 4 months ago
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring
At the core of the seminal Graph Minor Theory of Robertson and Seymour is a powerful structural theorem capturing the structure of graphs excluding a fixed minor. This result is ...
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ic...
GREC
2005
Springer
15 years 4 months ago
Sketch Parameterization Using Curve Approximation
This paper presents a method of parameterization for online freehand drawing objects based on a piecewise cubic Bezier curve approximation. The target is to represent sketches in a...
Zhengxing Sun, Wei Wang, Lisha Zhang, Jing Liu
ALGORITHMICA
2011
14 years 5 months ago
An Approximation Algorithm for Binary Searching in Trees
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
Eduardo Sany Laber, Marco Molinaro