1632 search results - page 52 / 327 » Sublinear Time Algorithms for Metric Space Problems |
111
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
The notion of universally decodable matrices (UDMs) was recently introduced by Tavildar and Viswanath while studying slow fading channels. It turns out that the problem of construc...
103
Voted
CDC
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract-- We consider here the problem of finding a controller such that when interconnected to the plant, we obtain a system which is asymptotically equivalent to a desired syste...
115
click to vote
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
168
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We give an algorithm for solving the exact Shortest Vector Problem in n-dimensional lattices, in any norm, in deterministic 2O(n) time (and space), given poly(n)-sized advice that...
167
click to vote
CODES
2003
IEEE
15 years 8 months ago
2003
IEEE
One of the most challenging problems in high-level synthesis is how to quickly explore a wide range of design options to achieve high-quality designs. This paper presents an Integ...