1301 search results - page 77 / 261 » Bounded Version Vectors |
132
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract—The problem of error-control in random linear network coding is considered. A “noncoherent” or “channel oblivious” model is assumed where neither transmitter nor...
174
Voted
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
211
Voted
PODS
2009
ACM
16 years 4 months ago
2009
ACM
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
129
Voted
CISS
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract— We consider the linear minimum meansquared error (LMMSE) estimation of a random vector of interest from its fusion frame measurements in presence noise and subspace era...
154
Voted
DCG
2011
14 years 10 months ago
2011
We introduce an algorithm that embeds a given 3-connected planar graph as a convex 3-polytope with integer coordinates. The size of the coordinates is bounded by O(27.55n ) = O(18...