164 search results - page 15 / 33 » Improved upper bounds on sizes of codes |
ICIP
2006
IEEE
15 years 11 months ago
2006
IEEE
We propose an integral image based algorithm to extract feature covariance matrices of all possible rectangular regions within a given image. Covariance is an essential indicator ...
FM
2001
Springer
15 years 1 months ago
2001
Springer
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
75
Voted
ISPD
2003
ACM
15 years 2 months ago
2003
ACM
This paper studies the optimality, scalability and stability of stateof-the-art partitioning and placement algorithms. We present algorithms to construct two classes of benchmarks...
FSTTCS
2000
Springer
15 years 1 months ago
2000
Springer
We present a new scheme for storing a planar graph in external memory so that any online path can be traversed in an I-O efficient way. Our storage scheme significantly improves th...
GLOBECOM
2007
IEEE
14 years 9 months ago
2007
IEEE
— In this paper, we introduce a network multicast problem called the alternating multicast problem. In this problem, there is more than one multicast on the network, but only one...