312 search results - page 46 / 63 » Iterative compression and exact algorithms |
105
click to vote
PCM
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. This paper presents a new method for extracting semantic information from basketball video. Our approach consists of three stages: shot and scene boundary detection, scen...
125
click to vote
CCP
2011
14 years 1 months ago
2011
—The Burrows-Wheeler Transform (BWT) is the basis for many of the most effective compression and selfindexing methods used today. A key to the versatility of the BWT is the abili...
161
click to vote
ACNS
2011
Springer
14 years 5 months ago
2011
Springer
Abstract. Recent developments in the field of cryptanalysis of hash functions has inspired NIST to announce a competition for selecting a new cryptographic hash function to join t...
133
click to vote
SODA
2010
ACM
15 years 10 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
119
click to vote
CVPR
2009
IEEE
16 years 8 months ago
2009
IEEE
Many problems in computer vision can be modeled using
conditional Markov random fields (CRF). Since finding
the maximum a posteriori (MAP) solution in such models
is NP-hard, mu...