Sciweavers

1236 search results - page 68 / 248
» fast 2010
Sort
View
136
Voted
ESA
2010
Springer
185views Algorithms» more  ESA 2010»
15 years 4 months ago
Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns
We show how to route on very large public transportation networks (up to half a billion arcs) with average query times of a few milliseconds. We take into account many realistic fe...
Hannah Bast, Erik Carlsson, Arno Eigenwillig, Robe...
CVPR
2010
IEEE
15 years 3 months ago
Fast directional chamfer matching
We study the object localization problem in images given a single hand-drawn example or a gallery of shapes as the object model. Although many shape matching algorithms have been ...
Ming-Yu Liu, Oncel Tuzel, Ashok Veeraraghavan, Ram...
128
Voted
EUROPAR
2010
Springer
15 years 3 months ago
A Fast 5/2-Approximation Algorithm for Hierarchical Scheduling
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel ...
Marin Bougeret, Pierre-François Dutot, Klau...
148
Voted
CORR
2010
Springer
109views Education» more  CORR 2010»
15 years 3 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...
CORR
2010
Springer
139views Education» more  CORR 2010»
15 years 3 months ago
Fast Overlapping Group Lasso
The group Lasso is an extension of the Lasso for feature selection on (predefined) non-overlapping groups of features. The non-overlapping group structure limits its applicability...
Jun Liu, Jieping Ye