Sciweavers

5595 search results - page 381 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
16 years 1 months ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos
JPDC
2007
177views more  JPDC 2007»
15 years 6 months ago
Adaptive decomposition and remapping algorithms for object-space-parallel direct volume rendering of unstructured grids
Object space (OS) parallelization of an efficient direct volume rendering algorithm for unstructured grids on distributed-memory architectures is investigated. The adaptive OS de...
Cevdet Aykanat, Berkant Barla Cambazoglu, Ferit Fi...
PC
2010
145views Management» more  PC 2010»
15 years 5 months ago
GPU computing with Kaczmarz's and other iterative algorithms for linear systems
The graphics processing unit (GPU) is used to solve large linear systems derived from partial differential equations. The differential equations studied are strongly convection-...
Joseph M. Elble, Nikolaos V. Sahinidis, Panagiotis...
WADS
2007
Springer
128views Algorithms» more  WADS 2007»
16 years 27 days ago
Approximate Range Searching: The Absolute Model
Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε >...
Guilherme Dias da Fonseca
ATAL
2008
Springer
15 years 8 months ago
Adaptive Kanerva-based function approximation for multi-agent systems
In this paper, we show how adaptive prototype optimization can be used to improve the performance of function approximation based on Kanerva Coding when solving largescale instanc...
Cheng Wu, Waleed Meleis