Sciweavers

2157 search results - page 173 / 432
» Optimal Fast Hashing
Sort
View
SODA
1997
ACM
93views Algorithms» more  SODA 1997»
15 years 5 months ago
Fast Approximate Graph Partitioning Algorithms
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
CORR
2008
Springer
185views Education» more  CORR 2008»
15 years 4 months ago
Realizing Fast, Scalable and Reliable Scientific Computations in Grid Environments
The practical realization of managing and executing large scale scientific computations efficiently and reliably is quite challenging. Scientific computations often invo...
Yong Zhao, Ioan Raicu, Ian T. Foster, Mihael Hateg...
CORR
2007
Springer
99views Education» more  CORR 2007»
15 years 4 months ago
Fast Selection of Spectral Variables with B-Spline Compression
The large number of spectral variables in most data sets encountered in spectral chemometrics often renders the prediction of a dependent variable uneasy. The number of variables ...
Fabrice Rossi, Damien François, Vincent Wer...
SIAMSC
2008
131views more  SIAMSC 2008»
15 years 4 months ago
Fast Monte Carlo Simulation Methods for Biological Reaction-Diffusion Systems in Solution and on Surfaces
Many important physiological processes operate at time and space scales far beyond those accessible to atom-realistic simulations, and yet discrete stochastic rather than continuum...
Rex A. Kerr, Thomas M. Bartol, Boris Kaminsky, Mar...
TMI
2008
141views more  TMI 2008»
15 years 4 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...