Sciweavers

330 search results - page 16 / 66
» Isosurfacing in higher dimensions
Sort
View
IFIP
2004
Springer
14 years 1 months ago
A Randomised Algorithm for Checking the Normality of Cryptographic Boolean Functions
Abstract A Boolean function is called normal if it is constant on flats of certain dimensions. This property is relevant for the construction and analysis of cryptosystems. This p...
An Braeken, Christopher Wolf, Bart Preneel
ISAAC
2004
Springer
135views Algorithms» more  ISAAC 2004»
14 years 1 months ago
Geometric Optimization Problems Over Sliding Windows
Abstract. We study the problem of maintaining a (1+ )-factor approximation of the diameter of a stream of points under the sliding window model. In one dimension, we give a simple ...
Timothy M. Chan, Bashir S. Sadjad
DCG
2008
86views more  DCG 2008»
13 years 7 months ago
Efficient Algorithms for Maximum Regression Depth
We investigate algorithmic questions that arise in the statistical problem of computing lines or hyperplanes of maximum regression depth among a set of n points. We work primarily...
Marc J. van Kreveld, Joseph S. B. Mitchell, Peter ...
ICDE
2007
IEEE
116views Database» more  ICDE 2007»
14 years 9 months ago
MultiMap: Preserving disk locality for multidimensional datasets
MultiMap is an algorithm for mapping multidimensional datasets so as to preserve the data's spatial locality on disks. Without revealing disk-specific details to applications...
Minglong Shao, Steven W. Schlosser, Stratos Papado...
IMA
2009
Springer
131views Cryptology» more  IMA 2009»
14 years 2 months ago
An Improvement to the Gaudry-Schost Algorithm for Multidimensional Discrete Logarithm Problems
Gaudry and Schost gave a low-memory algorithm for solving the 2-dimensional discrete logarithm problem. We present an improvement to their algorithm and extend this improvement to ...
Steven D. Galbraith, Raminder S. Ruprai