8413 search results - page 443 / 1683 » Ordering Problem Subgoals |
218
click to vote
ALGORITHMICA
2011
15 years 1 months ago
2011
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...
226
click to vote
ALT
2011
Springer
14 years 6 months ago
2011
Springer
This paper studies the deviations of the regret in a stochastic multi-armed bandit problem. When the total number of plays n is known beforehand by the agent, Audibert et al. (2009...
231
click to vote
IANDC
2011
15 years 1 months ago
2011
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...
241
click to vote
TASLP
2011
15 years 1 months ago
2011
Abstract—The shifted delta cepstrum (SDC) is a widely used feature extraction for language recognition (LRE). With a high context width due to incorporation of multiple frames, S...
217
Voted
SIAMJO
2010
15 years 1 months ago
2010
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...