Sciweavers

5169 search results - page 116 / 1034
» Locality approximation using time
Sort
View
155
Voted
JSCIC
2007
131views more  JSCIC 2007»
15 years 4 months ago
An Analysis of the Minimal Dissipation Local Discontinuous Galerkin Method for Convection-Diffusion Problems
Abstract. We analyze the so-called the minimal dissipation local discontinuous Galerkin method for convection-diffusion or diffusion problems. The distinctive feature of this met...
Bernardo Cockburn, Bo Dong
ICPADS
2007
IEEE
15 years 11 months ago
On the relative value of local scheduling versus routing in parallel server systems
We consider a system with a dispatcher and several identical servers in parallel. Task processing times are known upon arrival. We first study the impact of the local scheduling ...
Rong Wu, Douglas G. Down
SPATIALCOGNITION
2004
Springer
15 years 10 months ago
Treemap: An O(log n) Algorithm for Simultaneous Localization and Mapping
This paper presents a very efficient SLAM algorithm that works by hierarchically dividing the map into local regions and subregions. At each level of the hierarchy each region stor...
Udo Frese
ICASSP
2008
IEEE
15 years 11 months ago
Query adaptative locality sensitive hashing
It is well known that high-dimensional nearest-neighbor retrieval is very expensive. Many signal processing methods suffer from this computing cost. Dramatic performance gains can...
Herve Jegou, Laurent Amsaleg, Cordelia Schmid, Pat...
WSCG
2003
165views more  WSCG 2003»
15 years 6 months ago
A Shape Constrained Curve Approximation Method for Styling Surfaces Modeling
The problem of styling surfaces modeling is tackled. An approach based on section curves fairing is chosen. The concept of template curves is developed for approximating profiles ...
Yves Mineur