Sciweavers

82 search results - page 9 / 17
» Approximation Algorithms for Orienteering with Time Windows
Sort
View
GIS
2007
ACM
14 years 8 months ago
Approximate order-k Voronoi cells over positional streams
Handling streams of positional updates from numerous moving objects has become a challenging task for many monitoring applications. Several algorithms have been recently proposed ...
Kostas Patroumpas, Theofanis Minogiannis, Timos K....
CORR
2010
Springer
107views Education» more  CORR 2010»
13 years 6 months ago
Distributed Detection over Time Varying Networks: Large Deviations Analysis
—We apply large deviations theory to study asymptotic performance of running consensus distributed detection in sensor networks. Running consensus is a stochastic approximation t...
Dragana Bajovic, Dusan Jakovetic, João Xavi...
COMGEO
2012
ACM
12 years 3 months ago
Algorithms for the edge-width of an embedded graph
Let G be an unweighted graph of complexity n embedded in a surface of genus g, orientable or not. We describe improved algorithms to compute a shortest non-contractible and a shor...
Sergio Cabello, Éric Colin de Verdiè...
CRV
2006
IEEE
128views Robotics» more  CRV 2006»
14 years 1 months ago
Local Stereo Matching with Segmentation-based Outlier Rejection
We present a new window-based stereo matching algorithm which focuses on robust outlier rejection during aggregation. The main difficulty for window-based methods lies in determi...
Mark Gerrits, Philippe Bekaert
CORR
2010
Springer
109views Education» more  CORR 2010»
13 years 7 months ago
Fast space-variant elliptical filtering using box splines
The efficient realization of linear space-variant (non-convolution) filters is a challenging computational problem in image processing. In this paper, we demonstrate that it is po...
Kunal Narayan Chaudhury, Arrate Muñoz-Barru...