Sciweavers

363 search results - page 6 / 73
» Finding Small Solutions to Small Degree Polynomials
Sort
View
STACS
2009
Springer
14 years 4 days ago
Almost-Uniform Sampling of Points on High-Dimensional Algebraic Varieties
We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials ...
Mahdi Cheraghchi, Amin Shokrollahi
EMNLP
2008
13 years 9 months ago
Complexity of Finding the BLEU-optimal Hypothesis in a Confusion Network
Confusion networks are a simple representation of multiple speech recognition or translation hypotheses in a machine translation system. A typical operation on a confusion network...
Gregor Leusch, Evgeny Matusov, Hermann Ney
STOC
1995
ACM
145views Algorithms» more  STOC 1995»
13 years 11 months ago
Polynomial time approximation schemes for dense instances of NP-hard problems
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
Sanjeev Arora, David R. Karger, Marek Karpinski
IROS
2009
IEEE
155views Robotics» more  IROS 2009»
14 years 2 months ago
Kinematic calibration of a parallel robot for small animal biopsies
— In biomedical research it is difficult to perceive tumors or cells and perform biopsies manually. Robotics technology can offer a reliable solution for accurate needle inserti...
Myun Joong Hwang, Ozkan Bebek, Fan Liang, Baowei F...
COCO
2010
Springer
144views Algorithms» more  COCO 2010»
13 years 11 months ago
A Regularity Lemma, and Low-Weight Approximators, for Low-Degree Polynomial Threshold Functions
We give a “regularity lemma” for degree-d polynomial threshold functions (PTFs) over the Boolean cube {−1, 1}n . Roughly speaking, this result shows that every degree-d PTF ...
Ilias Diakonikolas, Rocco A. Servedio, Li-Yang Tan...