168 search results - page 2 / 34 » An Upper Bound for B2[2] Sequences |
GIS
2006
ACM
14 years 6 months ago
2006
ACM
Given a query point and a collection of spatial features, a multi-type nearest neighbor (MTNN) query finds the shortest tour for the query point such that only one instance of eac...
JCT
2000
13 years 5 months ago
2000
![An Upper Bound for B2[2] Sequences](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "An Upper Bound for B2[2] Sequences")
Abstract. We introduce a new counting method to deal with B2[2] sequences, getting a new upper bound for the size of these sequences, F(N, 2)
CDC
2010
IEEE
13 years 12 days ago
2010
IEEE
In this paper we study statistical properties of the error covariance matrix of a Kalman filter, when it is subject to random measurement losses. We introduce a sequence of tighter...
COLT
2001
Springer
13 years 10 months ago
2001
Springer
Intrinsic complexity is used to measure the complexity of learning areas limited by broken-straight lines (called open semi-hulls) and intersections of such areas. Any strategy le...
CORR
2004
Springer
13 years 5 months ago
2004
Springer
A variable-length code is a fix-free code if no codeword is a prefix or a suffix of any other codeword. In a fix-free code any finite sequence of codewords can be decoded in both d...