Sciweavers

4047 search results - page 175 / 810
» The Discrete Basis Problem
Sort
View
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
15 years 10 months ago
Lower Bounds for Sparse Recovery
We consider the following k-sparse recovery problem: design an m ? n matrix A, such that for any signal x, given Ax we can efficiently recover ^x satisfying
khanh do ba, piotr indyk, eric price
PODC
2005
ACM
15 years 6 months ago
Facility location: distributed approximation
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
Thomas Moscibroda, Roger Wattenhofer
ASIACRYPT
2001
Springer
15 years 5 months ago
Supersingular Curves in Cryptography
Abstract. Frey and R¨uck gave a method to transform the discrete logarithm problem in the divisor class group of a curve over Fq into a discrete logarithm problem in some finite ...
Steven D. Galbraith
ECAI
2010
Springer
14 years 11 months ago
A Hybrid Continuous Max-Sum Algorithm for Decentralised Coordination
Abstract. In this paper we tackle the problem of coordinating multiple decentralised agents with continuous state variables. Specifically we propose a hybrid approach, which combin...
Thomas Voice, Ruben Stranders, Alex Rogers, Nichol...
ISSAC
2007
Springer
91views Mathematics» more  ISSAC 2007»
15 years 7 months ago
Generation and optimisation of code using coxeter lattice paths
Supercomputing applications usually involve the repeated parallel application of discretized differential operators. Difficulties arise with higher-order discretizations of opera...
Thomas J. Ashby, Anthony D. Kennedy, Stephen M. Wa...