3367 search results - page 196 / 674 » Incremental assignment problem |
135
Voted
BMVC
1998
15 years 4 months ago
1998
In this paper, we discuss a method for representing and matching planar curves. The technique is based on using calculations from concentric circles to represent each curve by two...
137
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
This work presents GROUSE (Grassmanian Rank-One Update Subspace Estimation), an efficient online algorithm for tracking subspaces from highly incomplete observations. GROUSE requi...
165
Voted
CVPR
2011
IEEE
14 years 7 months ago
2011
IEEE
Two problems occur when bundle adjustment (BA) is applied on long image sequences: the large calculation time and the drift (or error accumulation). In recent work, the calculatio...
131
Voted
INFOCOM
2003
IEEE
15 years 8 months ago
2003
IEEE
Abstract – In this paper, we develop failure-resilient techniques for monitoring link delays and faults in a Service Provider or Enterprise IP network. Our two-phased approach at...
126
click to vote
OL
2010
15 years 1 months ago
2010
One of the main goals in transportation planning is to achieve solutions for two classical problems, the traffic assignment and toll pricing problems. The traffic assignment proble...