Sciweavers

409 search results - page 58 / 82
» Polynomial Time Approximation Schemes and Parameterized Comp...
Sort
View
MOC
2002
135views more  MOC 2002»
14 years 9 months ago
A fast spherical harmonics transform algorithm
The spectral method with discrete spherical harmonics transform plays an important role in many applications. In spite of its advantages, the spherical harmonics transform has a dr...
Reiji Suda, Masayasu Takami
ICPP
2007
IEEE
15 years 4 months ago
Architectural Challenges in Memory-Intensive, Real-Time Image Forming
The real-time image forming in future, high-end synthetic aperture radar systems is an example of an application that puts new demands on computer architectures. The initial quest...
Anders Ahlander, H. Hellsten, K. Lind, J. Lindgren...
STOC
2006
ACM
186views Algorithms» more  STOC 2006»
15 years 10 months ago
A subset spanner for Planar graphs, : with application to subset TSP
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
Philip N. Klein
EUROGRAPHICS
2010
Eurographics
15 years 4 months ago
Interactive High-Quality Visualization of Higher-Order Finite Elements
Higher-order finite element methods have emerged as an important discretization scheme for simulation. They are increasingly used in contemporary numerical solvers, generating a ...
Markus Üffinger, Steffen Frey, Thomas Ertl
FSTTCS
2009
Springer
15 years 4 months ago
Kernels for Feedback Arc Set In Tournaments
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...
Stéphane Bessy, Fedor V. Fomin, Serge Gaspe...