Sciweavers

530 search results - page 58 / 106
» An Algorithm for Approximating the Satisfiability Problem of...
Sort
View
CORR
2006
Springer
123views Education» more  CORR 2006»
13 years 8 months ago
Counting good truth assignments of random k-SAT formulae
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
Andrea Montanari, Devavrat Shah
FGR
2004
IEEE
218views Biometrics» more  FGR 2004»
13 years 11 months ago
Affine Correspondence Based Head Pose Estimation for a Sequence of Images by Using a 3D Model
This paper proposes a method of determining human head poses from a sequence of images. The main idea is to use some features in a 3D head model to generate a virtual fronto-paral...
Guoyuan Liang, Hongbin Zha, Hong Liu
SODA
2010
ACM
261views Algorithms» more  SODA 2010»
14 years 5 months ago
Bidimensionality and Kernels
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...
COMPGEOM
2004
ACM
14 years 1 months ago
Low-dimensional embedding with extra information
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Haji...
CORR
2008
Springer
136views Education» more  CORR 2008»
13 years 8 months ago
Multi-Armed Bandits in Metric Spaces
In a multi-armed bandit problem, an online algorithm chooses from a set of strategies in a sequence of n trials so as to maximize the total payoff of the chosen strategies. While ...
Robert Kleinberg, Aleksandrs Slivkins, Eli Upfal