619 search results - page 88 / 124 » A dynamical systems approach to weighted graph matching |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
This paper derives a near optimal distributed Kalman filter to estimate a large-scale random field monitored by a network of N sensors. The field is described by a sparsely con...
HICSS
2000
IEEE
14 years 2 days ago
2000
IEEE
We address the problem of message ordering for reliable multicast communication. End-to-end multicast ordering is useful for ensuring the collective integrity and consistency of d...
BMVC
2010
13 years 5 months ago
2010
We present a scalable and incremental approach for creating interactive image-based walkthroughs from a dynamically growing collection of photographs of a scene. Prior approaches,...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
Matching based on local brightness is quite limited, because
small changes on local appearance invalidate the
constancy in brightness. The root of this limitation is its
treatme...
CPM
2005
Springer
13 years 9 months ago
2005
Springer
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...