Sciweavers

133 search results - page 7 / 27
» Simple and practical algorithm for sparse Fourier transform
Sort
View
ACL
1996
13 years 8 months ago
Efficient Transformation-Based Parsing
In transformation-based parsing, a finite sequence of tree rewriting rules are checked for application to an input structure. Since in practice only a small percentage of rules ar...
Giorgio Satta, Eric Brill
SIGMOD
2010
ACM
236views Database» more  SIGMOD 2010»
14 years 6 days ago
Differentially private aggregation of distributed time-series with transformation and encryption
We propose PASTE, the first differentially private aggregation algorithms for distributed time-series data that offer good practical utility without any trusted server. PASTE add...
Vibhor Rastogi, Suman Nath
ICIP
2001
IEEE
14 years 9 months ago
Efficient feature extraction for 2D/3D objects in mesh representation
Meshes are dominantly used to represent 3D models as they fit well with graphics rendering hardware. Features such as volume, moments, and Fourier transform coefficients need to b...
Cha Zhang, Tsuhan Chen
JCPHY
2011
87views more  JCPHY 2011»
12 years 10 months ago
A fast directional algorithm for high-frequency electromagnetic scattering
This paper is concerned with the fast solution of high frequency electromagnetic scattering problems using the boundary integral formulation. We extend the O(N log N) directional ...
Paul Tsuji, Lexing Ying
SOFSEM
2007
Springer
14 years 1 months ago
Fast Approximate Point Set Matching for Information Retrieval
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
Raphaël Clifford, Benjamin Sach