Sciweavers

4131 search results - page 45 / 827
» The Generalized Max-Controlled Set Problem
Sort
View
132
Voted
EMNLP
2011
14 years 2 months ago
Entire Relaxation Path for Maximum Entropy Problems
We discuss and analyze the problem of finding a distribution that minimizes the relative entropy to a prior distribution while satisfying max-norm constraints with respect to an ...
Moshe Dubiner, Yoram Singer
137
Voted
JACM
2010
116views more  JACM 2010»
15 years 1 months ago
The complexity of temporal constraint satisfaction problems
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
Manuel Bodirsky, Jan Kára
137
Voted
MOC
2002
131views more  MOC 2002»
15 years 2 months ago
Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...
Douglas R. Stinson
161
Voted
ALT
2011
Springer
14 years 2 months ago
On Noise-Tolerant Learning of Sparse Parities and Related Problems
We consider the problem of learning sparse parities in the presence of noise. For learning parities on r out of n variables, we give an algorithm that runs in time poly log 1 δ , ...
Elena Grigorescu, Lev Reyzin, Santosh Vempala
116
Voted
COMBINATORICS
2007
112views more  COMBINATORICS 2007»
15 years 2 months ago
Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set
In the last decade there has been an ongoing interest in string comparison problems; to a large extend the interest was stimulated by genome rearrangement problems in computationa...
Petr Kolman, Tomasz Walen