Sciweavers

140 search results - page 27 / 28
» Parameterized Animation Compression
Sort
View
110
Voted
SODA
2010
ACM
177views Algorithms» more  SODA 2010»
16 years 4 days ago
Convergence, Stability, and Discrete Approximation of Laplace Spectra
Spectral methods have been widely used in a broad range of application fields. One important object involved in such methods is the Laplace-Beltrami operator of a manifold. Indeed...
Tamal K. Dey, Pawas Ranjan, Yusu Wang
138
Voted
FPGA
2005
ACM
195views FPGA» more  FPGA 2005»
15 years 8 months ago
Sparse Matrix-Vector multiplication on FPGAs
Floating-point Sparse Matrix-Vector Multiplication (SpMXV) is a key computational kernel in scientific and engineering applications. The poor data locality of sparse matrices sig...
Ling Zhuo, Viktor K. Prasanna
130
Voted
SC
2003
ACM
15 years 8 months ago
Remote Visualization by Browsing Image Based Databases with Logistical Networking
The need to provide remote visualization of large datasets with adequate levels of quality and interactivity has become a major impediment to distributed collaboration in Computat...
Jin Ding, Jian Huang, Micah Beck, Shaotao Liu, Ter...
144
Voted
SWAT
2010
Springer
250views Algorithms» more  SWAT 2010»
15 years 7 months ago
Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing
Given a permutation π of {1, . . . , n} and a positive integer k, we give an algorithm with running time 2O(k2 log k) nO(1) that decides whether π can be partitioned into at mos...
Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov...
167
Voted
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
15 years 6 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek