Sciweavers

10988 search results - page 400 / 2198
» Algorithmic Folding Complexity
Sort
View
115
Voted
TCBB
2008
73views more  TCBB 2008»
15 years 5 months ago
Nature Reserve Selection Problem: A Tight Approximation Algorithm
The Nature Reserve Selection Problem is a problem that arises in the context of studying biodiversity conservation. Subject to budgetary constraints, the problem is to select a set...
Magnus Bordewich, Charles Semple
128
Voted
ICASSP
2011
IEEE
14 years 8 months ago
High-throughput implementation of tree-search algorithms for vector precoding
This contribution analyzes the architecture design and FPGA implementation of high-throughput multiuser vector precoders. The most complex task of such precoders, i.e. the search ...
Maitane Barrenechea, Luis G. Barbero, Idoia Jimene...
COMPGEOM
2011
ACM
14 years 8 months ago
Zigzag persistent homology in matrix multiplication time
We present a new algorithm for computing zigzag persistent homology, an algebraic structure which encodes changes to homology groups of a simplicial complex over a sequence of sim...
Nikola Milosavljevic, Dmitriy Morozov, Primoz Skra...
163
Voted
SIAMJO
2008
117views more  SIAMJO 2008»
15 years 5 months ago
Two Algorithms for the Minimum Enclosing Ball Problem
Given A := {a1, . . . , am} Rn and > 0, we propose and analyze two algorithms for the problem of computing a (1 + )-approximation to the radius of the minimum enclosing ball o...
E. Alper Yildirim
148
Voted
FSE
2009
Springer
107views Cryptology» more  FSE 2009»
15 years 12 months ago
Multidimensional Extension of Matsui's Algorithm 2
Matsui’s one-dimensional Alg. 2 can be used for recovering bits of the last round key of a block cipher. In this paper a truly multidimensional extension of Alg. 2 based on estab...
Miia Hermelin, Joo Yeon Cho, Kaisa Nyberg