Sciweavers

340 search results - page 28 / 68
» A New Algorithm for the Construction of Optimal B-Trees
Sort
View
STOC
2003
ACM
124views Algorithms» more  STOC 2003»
14 years 8 months ago
Extractors: optimal up to constant factors
This paper provides the first explicit construction of extractors which are simultaneously optimal up to constant factors in both seed length and output length. More precisely, fo...
Chi-Jen Lu, Omer Reingold, Salil P. Vadhan, Avi Wi...
ECCC
2006
77views more  ECCC 2006»
13 years 7 months ago
Extractors and condensers from univariate polynomials
We give new constructions of randomness extractors and lossless condensers that are optimal to within constant factors in both the seed length and the output length. For extractor...
Venkatesan Guruswami, Christopher Umans, Salil P. ...
ESA
2007
Springer
105views Algorithms» more  ESA 2007»
14 years 1 months ago
Finding Branch-Decompositions and Rank-Decompositions
Abstract. We present a new algorithm that can output the rankdecomposition of width at most k of a graph if such exists. For that we use an algorithm that, for an input matroid rep...
Petr Hlinený, Sang-il Oum
SIGIR
2008
ACM
13 years 7 months ago
Directly optimizing evaluation measures in learning to rank
One of the central issues in learning to rank for information retrieval is to develop algorithms that construct ranking models by directly optimizing evaluation measures used in i...
Jun Xu, Tie-Yan Liu, Min Lu, Hang Li, Wei-Ying Ma
LREC
2010
159views Education» more  LREC 2010»
13 years 9 months ago
Towards Optimal TTS Corpora
Unit selection text-to-speech systems currently produce very natural synthesized phrases by concatenating speech segments from a large database. Recently, increasing demand for de...
Didier Cadic, Cédric Boidin, Christophe d'A...