Sciweavers

476 search results - page 2 / 96
» A Subgradient Algorithm For Computational Distances and Appl...
Sort
View
ICCV
2011
IEEE
12 years 4 months ago
Dense Disparity Maps from Sparse Disparity Measurements
In this work we propose a method for estimating disparity maps from very few measurements. Based on the theory of Compressive Sensing, our algorithm accurately reconstructs dispar...
Simon Hawe, Martin Kleinsteuber, Klaus Diepold
SAC
2009
ACM
13 years 11 months ago
GPU-based computation of distance functions on road networks with applications
We present a GPU-based algorithm for computing discretized distance functions on road networks. As applications, we provide algorithms for computing discrete Order-k Network Voron...
Marta Fort, Joan Antoni Sellarès
ASIACRYPT
2006
Springer
13 years 8 months ago
The 2-Adic CM Method for Genus 2 Curves with Application to Cryptography
Abstract. The complex multiplication (CM) method for genus 2 is currently the most efficient way of generating genus 2 hyperelliptic curves defined over large prime fields and suit...
Pierrick Gaudry, T. Houtmann, D. Kohel, Christophe...
ISSAC
2007
Springer
132views Mathematics» more  ISSAC 2007»
13 years 10 months ago
Adaptive loops with kaapi on multicore and grid: applications in symmetric cryptography
The parallelization of two applications in symmetric cryptography is considered: block ciphering and a new method based on random sampling for the selection of basic substitution ...
Vincent Danjean, Roland Gillard, Serge Guelton, Je...
ECUMN
2007
Springer
13 years 10 months ago
End-to-End Distance Computation in Grid Environment by NDS, the Network Distance Service
This article presents a novel method for computing distances between hosts in a computational Grid. Our method allows to represent the cost to achieve any operation involving some...
Julien Gossa, Jean-Marc Pierson