Sciweavers

725 search results - page 45 / 145
» A General Greedy Approximation Algorithm with Applications
Sort
View
WOB
2004
120views Bioinformatics» more  WOB 2004»
14 years 11 months ago
Reconfigurable Systems for Sequence Alignment and for General Dynamic Programming
ABSTRACT. Reconfigurable systolic arrays can be adapted to efficiently resolve a wide spectrum of computational problems; parallelism is naturally explored in systolic arrays and r...
Ricardo P. Jacobi, Mauricio Ayala-Rincón, L...
ALT
2009
Springer
15 years 6 months ago
Average-Case Active Learning with Costs
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
Andrew Guillory, Jeff A. Bilmes
CORR
2010
Springer
210views Education» more  CORR 2010»
14 years 9 months ago
Exploiting Statistical Dependencies in Sparse Representations for Signal Recovery
Signal modeling lies at the core of numerous signal and image processing applications. A recent approach that has drawn considerable attention is sparse representation modeling, in...
Tomer Faktor, Yonina C. Eldar, Michael Elad
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
14 years 11 months ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...
SODA
2007
ACM
145views Algorithms» more  SODA 2007»
14 years 11 months ago
Aggregation of partial rankings, p-ratings and top-m lists
We study the problem of aggregating partial rankings. This problem is motivated by applications such as meta-searching and information retrieval, search engine spam fighting, e-c...
Nir Ailon