Sciweavers

148 search results - page 16 / 30
» Fast Data Anonymization with Low Information Loss
Sort
View
ORL
1998
68views more  ORL 1998»
13 years 7 months ago
A fast bipartite network flow algorithm for selective assembly
Bipartite network flow problems naturally arise in applications such as selective assembly and preemptive scheduling. This paper presents fast algorithms for these problems that ...
Satoru Iwata, Tomomi Matsui, S. Thomas McCormick
TMI
2008
141views more  TMI 2008»
13 years 7 months ago
Fast Noise Reduction in Computed Tomography for Improved 3-D Visualization
Computed tomography (CT) has a trend towards higher resolution and higher noise. This development has increased the interest in anisotropic smoothing techniques for CT, which aim t...
Michiel Schaap, Arnold M. R. Schilham, Karel J. Zu...
DCC
2010
IEEE
14 years 2 months ago
Xampling: Analog Data Compression
We introduce Xampling, a design methodology for analog compressed sensing in which we sample analog bandlimited signals at rates far lower than Nyquist, without loss of informatio...
Moshe Mishali, Yonina C. Eldar
ISVC
2009
Springer
14 years 2 months ago
Fast Occlusion Sweeping
While realistic illumination significantly improves the visual quality and perception of rendered images, it is often very expensive to compute. In this paper, we propose a new al...
Mayank Singh, Cem Yuksel, Donald H. House
EUROPAR
2007
Springer
13 years 11 months ago
On Using Incremental Profiling for the Performance Analysis of Shared Memory Parallel Applications
Abstract. Profiling is often the method of choice for performance analysis of parallel applications due to its low overhead and easily comprehensible results. However, a disadvanta...
Karl Fürlinger, Michael Gerndt, Jack Dongarra