Sciweavers

239 search results - page 6 / 48
» A Simple Algorithm for Computing the Lempel Ziv Factorizatio...
Sort
View
GRAPHITE
2006
ACM
14 years 1 months ago
Two-stage compression for fast volume rendering of time-varying scalar data
This paper presents a two-stage compression method for accelerating GPU-based volume rendering of time-varying scalar data. Our method aims at reducing transfer time by compressin...
Daisuke Nagayasu, Fumihiko Ino, Kenichi Hagihara
CORR
2004
Springer
122views Education» more  CORR 2004»
13 years 7 months ago
Simple Distributed Weighted Matchings
Wattenhofer et al. [WW04] derive a complicated distributed algorithm to compute a weighted matching of an arbitrary weighted graph, that is at most a factor 5 away from the maximu...
Jaap-Henk Hoepman
ISMVL
2007
IEEE
112views Hardware» more  ISMVL 2007»
14 years 1 months ago
Survey of Stochastic Computation on Factor Graphs
Stochastic computation is a new alternative approach for iterative computation on factor graphs. In this approach, the information is represented by the statistics of the bit stre...
Saeed Sharifi Tehrani, Shie Mannor, Warren J. Gros...
DAC
2005
ACM
14 years 8 months ago
Segregation by primary phase factors: a full-wave algorithm for model order reduction
Existing Full-wave Model Order Reduction (FMOR) approaches are based on Expanded Taylor Series Approximations (ETAS) of the oscillatory full-wave system matrix. The accuracy of su...
Thomas J. Klemas, Luca Daniel, Jacob K. White
TAMC
2009
Springer
14 years 1 months ago
A Simple Greedy Algorithm for the k-Disjoint Flow Problem
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
Maren Martens