Sciweavers

4581 search results - page 8 / 917
» Computing Transformation Semigroups
Sort
View
MPC
1995
Springer
116views Mathematics» more  MPC 1995»
13 years 11 months ago
Computer-Aided Computing
PVS is a highly automated framework for speci cation and veri cation. We show how the language and deduction features of PVS can be used to formalize, mechanize, and apply some us...
Natarajan Shankar
ICPR
2008
IEEE
14 years 8 months ago
Distance transformation, reverse distance transformation and discrete medial axis on toric spaces
In this paper, we present optimal in time algorithms to compute the distance transform, the reverse distance transform and the discrete medial axis on digital objects embedded on ...
David Coeurjolly
MOBICOM
2012
ACM
11 years 9 months ago
Faster GPS via the sparse fourier transform
GPS is one of the most widely used wireless systems. A GPS receiver has to lock on the satellite signals to calculate its position. The process of locking on the satellites is qui...
Haitham Hassanieh, Fadel Adib, Dina Katabi, Piotr ...
FOCS
1994
IEEE
13 years 11 months ago
A Spectral Approach to Lower Bounds
We establish a nonlinear lower bound for halfplane range searching over a group. Specifically, we show that summing up the weights of n (weighted) points within n halfplanes requir...
Bernard Chazelle
STOC
2012
ACM
192views Algorithms» more  STOC 2012»
11 years 9 months ago
Nearly optimal sparse fourier transform
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an ndimensional signal. We show: • An O(k log n)-time randomized algorithm f...
Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric ...