4137 search results - page 156 / 828 » On the number of matchings of a tree |
171
click to vote
ICIP
2007
IEEE
16 years 8 months ago
2007
IEEE
Integral projections have been proposed as an efficient method to reduce the dimensionality of the search space in motion estimation (ME) algorithms. A number of papers describe m...
161
click to vote
WEA
2007
Springer
16 years 19 days ago
2007
Springer
Given a sequence S of n symbols over some alphabet Σ, we develop a new compression method that is (i) very simple to implement; (ii) provides O(1) time random access to any symbol...
151
click to vote
ISM
2005
IEEE
16 years 3 days ago
2005
IEEE
This paper describes a novel technique for audio coding, a lossy compression algorithm, that considers perceptual and rate-distortion criteria. It is based on matched finite impu...
167
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We consider the problem of learning a matching (i.e., a graph in which all vertices have degree 0 or 1) in a model where the only allowed operation is to query whether a set of ve...
169
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...