Sciweavers

2188 search results - page 30 / 438
» Instance-Optimal Geometric Algorithms
Sort
View
MOBIHOC
2003
ACM
14 years 8 months ago
Worst-Case optimal and average-case efficient geometric ad-hoc routing
In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive ...
Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger
ICPR
2000
IEEE
14 years 9 months ago
Robust Dense Matching Using Local and Global Geometric Constraints
A new robust dense matching algorithm is introduced in this paper. The algorithm starts from matching the most textured points, then a match propagation algorithm is developed wit...
Maxime Lhuillier, Long Quan
CVPR
2010
IEEE
14 years 5 months ago
Relaxing the 3L algorithm for an accurate implicit polynomial fitting
This paper presents a novel method to increase the accuracy of linear fitting of implicit polynomials. The proposed method is based on the 3L algorithm philosophy. The novelty l...
Mohammad Rouhani and Angel D. Sappa
HAIS
2012
Springer
12 years 4 months ago
Generalized Weighted Majority Voting with an Application to Algorithms Having Spatial Output
In this paper we propose a method using a generalization of the weighted majority voting scheme to locate the optic disc (OD) in retinal images automatically. The location with the...
Henrietta Toman, Laszlo Kovacs, Agnes Jonas, Lajos...
ISAAC
2004
Springer
135views Algorithms» more  ISAAC 2004»
14 years 2 months ago
Geometric Optimization Problems Over Sliding Windows
Abstract. We study the problem of maintaining a (1+ )-factor approximation of the diameter of a stream of points under the sliding window model. In one dimension, we give a simple ...
Timothy M. Chan, Bashir S. Sadjad