Sciweavers

7197 search results - page 280 / 1440
» On the computational power of BlenX
Sort
View
FPL
2004
Springer
75views Hardware» more  FPL 2004»
15 years 10 months ago
Wavelet-Based Image Compression on the Reconfigurable Computer ACE-V
Wavelet-based image compression has been suggested previously as a means to evaluate and compare both traditional and reconfigurable computers in terms of performance and resource ...
Hagen Gädke, Andreas Koch
CORR
2006
Springer
114views Education» more  CORR 2006»
15 years 6 months ago
Fast algorithms for computing isogenies between elliptic curves
We survey algorithms for computing isogenies between elliptic curves defined over a field of characteristic either 0 or a large prime. We introduce a new algorithm that computes an...
Alin Bostan, Bruno Salvy, François Morain, ...
COCO
1998
Springer
109views Algorithms» more  COCO 1998»
15 years 11 months ago
Complexity Limitations on Quantum Computation
We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the p...
Lance Fortnow, John D. Rogers
STOC
1996
ACM
197views Algorithms» more  STOC 1996»
15 years 10 months ago
Computing Betti Numbers via Combinatorial Laplacians
We use the Laplacian and power method to compute Betti numbers of simplicial complexes. This has a number of advantages over other methods, both in theory and in practice. It requ...
Joel Friedman
PODC
2009
ACM
16 years 7 months ago
Oblivious interference scheduling
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
Alexander Fanghänel, Berthold Vöcking, H...