1391 search results - page 205 / 279 » Optimally Sparse Frames |
224
click to vote
SIGMOD
2009
ACM
16 years 5 months ago
2009
ACM
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
157
click to vote
CISS
2008
IEEE
15 years 11 months ago
2008
IEEE
—Reliable wireless communications often requires accurate knowledge of the underlying multipath channel. This typically involves probing of the channel with a known training wave...
164
click to vote
ICCV
1999
IEEE
15 years 9 months ago
1999
IEEE
We present a novel, efficient, initializationfree approach to the problem of epipolar geometry estimation, by formulating it as one of hyperplane inference from a sparse and noisy...
141
click to vote
PPOPP
1997
ACM
15 years 9 months ago
1997
ACM
Parallel algorithm designers need computational models that take first order system costs into account, but are also simple enough to use in practice. This paper introduces the L...
166
Voted
ESA
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We consider the problem of encoding a graph with n vertices and m edges compactly supporting adjacency, neighborhood and degree queries in constant time in the log n-bit ...