Sciweavers

4066 search results - page 11 / 814
» Improved Algorithms and Analysis for Secretary Problems and ...
Sort
View
MOC
2002
131views more  MOC 2002»
13 years 7 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
SODA
1997
ACM
115views Algorithms» more  SODA 1997»
13 years 8 months ago
On-Line Difference Maximization
In this paper we examine problems motivated by on-line financial problems and stochastic games. In particular, we consider a sequence of entirely arbitrary distinct values arrivin...
Ming-Yang Kao, Stephen R. Tate
FOCS
2006
IEEE
14 years 1 months ago
Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
Uriel Feige, Jan Vondrák
SPEECH
1998
171views more  SPEECH 1998»
13 years 7 months ago
Heteroscedastic discriminant analysis and reduced rank HMMs for improved speech recognition
We present the theory for heteroscedastic discriminant analysis (HDA), a model-based generalization of linear discriminant analysis (LDA) derived in the maximum-likelihood framewo...
Nagendra Kumar, Andreas G. Andreou
ISAAC
2005
Springer
120views Algorithms» more  ISAAC 2005»
14 years 29 days ago
Improved Algorithms for Largest Cardinality 2-Interval Pattern Problem
Abstract The 2-Interval Pattern problem is to find the largest constrained pattern in a set of 2-intervals. The constrained pattern is a subset of the given 2-intervals such that ...
Hao Yuan, Linji Yang, Erdong Chen