1327 search results - page 163 / 266 » Path following algorithm for the graph matching problem |
141
Voted
VISUALIZATION
1999
IEEE
15 years 8 months ago
1999
IEEE
ct A method for comparing three-dimensional vector fields constructed from simple critical points is described. This method is a natural extension of the previous work [1] which de...
133
Voted
SIGCOMM
2004
ACM
15 years 9 months ago
2004
ACM
We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be kn...
240
click to vote
ICRA
2008
IEEE
15 years 10 months ago
2008
IEEE
— Image-based navigation paradigms have recently emerged as an interesting alternative to conventional modelbased methods in mobile robotics. In this paper, we augment the existi...
170
click to vote
SODA
2012
ACM
13 years 6 months ago
2012
ACM
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem. This problem consists...
135
click to vote
STACS
2010
Springer
15 years 10 months ago
2010
Springer
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...