Sciweavers

51 search results - page 10 / 11
» The Shortest Vector Problem in Lattices with Many Cycles
Sort
View
SIAMSC
2011
148views more  SIAMSC 2011»
13 years 7 days ago
Bootstrap AMG
We develop an algebraic multigrid (AMG) setup scheme based on the bootstrap framework for multiscale scientific computation. Our approach uses a weighted least squares definition...
Achi Brandt, James J. Brannick, K. Kahl, Irene Liv...
ICASSP
2009
IEEE
14 years 15 days ago
MIMO decoding based on stochastic reconstruction from multiple projections
Least squares (LS) fitting is one of the most fundamental techniques in science and engineering. It is used to estimate parameters from multiple noisy observations. In many probl...
Amir Leshem, Jacob Goldberger
CN
2010
88views more  CN 2010»
13 years 5 months ago
Two-link failure protection in WDM mesh networks with p-cycles
In WDM networks, it is important to protect connections against link failures due to the high bandwidth provided by a fiber link. Although many p-cycle based schemes have been pro...
Taiming Feng, Long Long, Ahmed E. Kamal, Lu Ruan
STOC
2003
ACM
174views Algorithms» more  STOC 2003»
14 years 6 months ago
Adiabatic quantum state generation and statistical zero knowledge
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quant...
Dorit Aharonov, Amnon Ta-Shma
SIAMDM
2008
119views more  SIAMDM 2008»
13 years 5 months ago
On the Graph Bisection Cut Polytope
Given a graph G = (V, E) with node weights v N {0}, v V , and some number F N{0}, the convex hull of the incidence vectors of all cuts (S), S V with (S) F and (V \ S) F is ...
Michael Armbruster, Christoph Helmberg, Marzena F&...