3131 search results - page 257 / 627 » Generalized connection caching |
163
click to vote
BMVC
1998
15 years 8 months ago
1998
When using a gradient-basedmethod to determine the optical flow field for an image sequence, it is generally appreciated that some spatial pre-filtering of the images is usually n...
162
click to vote
APPML
2007
15 years 6 months ago
2007
-An edge of a graph H with a perfect matching is a fixed edge if it either belongs to none or to all of the perfect matchings of H. It is shown that a connected plane bipartite gra...
151
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
This paper is focused on the performance analysis of binary linear block codes (or ensembles) whose transmission takes place over independent and memoryless parallel channels. New ...
147
click to vote
DCG
2006
15 years 6 months ago
2006
This paper sheds a new light on the split decomposition theory and T-theory from the viewpoint of convex analysis and polyhedral geometry. By regarding finite metrics as discrete ...
156
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Graphs are called navigable if one can find short paths through them using only local knowledge. It has been shown that for a graph to be navigable, its construction needs to mee...