Sciweavers

316 search results - page 26 / 64
» On Approximate Majority and Probabilistic Time
Sort
View
ISM
2008
IEEE
110views Multimedia» more  ISM 2008»
15 years 4 months ago
A Hardware-Independent Fast Logarithm Approximation with Adjustable Accuracy
Many multimedia applications rely on the computation of logarithms, for example, when estimating log-likelihoods for Gaussian Mixture Models. Knowing of the demand to compute loga...
Oriol Vinyals, Gerald Friedland
DILS
2007
Springer
15 years 3 months ago
Fast Approximate Duplicate Detection for 2D-NMR Spectra
2D-Nuclear magnetic resonance (NMR) spectroscopy is a powerful analytical method to elucidate the chemical structure of molecules. In contrast to 1D-NMR spectra, 2D-NMR spectra cor...
Björn Egert, Steffen Neumann, Alexander Hinne...
GIS
2007
ACM
15 years 10 months ago
An interactive framework for raster data spatial joins
Many Geographic Information System (GIS) applications must handle large geospatial datasets stored in raster representation. Spatial joins over raster data are important queries i...
Wan D. Bae, Petr Vojtechovský, Shayma Alkob...
MOBICOM
1996
ACM
15 years 1 months ago
Reducing Processor Power Consumption by Improving Processor Time Management in a Single-user Operating System
The CPU is one of the major power consumers in a portable computer, and considerable power can be saved by turning off the CPU when it is not doing useful work. In Apple's Ma...
Jacob R. Lorch, Alan Jay Smith
93
Voted
ICDCS
2006
IEEE
15 years 3 months ago
Fault-Tolerant Clustering in Ad Hoc and Sensor Networks
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer