Sciweavers

274 search results - page 47 / 55
» Counting lattice vectors
Sort
View
FSE
2008
Springer
91views Cryptology» more  FSE 2008»
15 years 1 months ago
SWIFFT: A Modest Proposal for FFT Hashing
We propose SWIFFT, a collection of compression functions that are highly parallelizable and admit very efficient implementations on modern microprocessors. The main technique under...
Vadim Lyubashevsky, Daniele Micciancio, Chris Peik...
SIAMSC
2011
148views more  SIAMSC 2011»
14 years 6 months ago
Bootstrap AMG
We develop an algebraic multigrid (AMG) setup scheme based on the bootstrap framework for multiscale scientific computation. Our approach uses a weighted least squares definition...
Achi Brandt, James J. Brannick, K. Kahl, Irene Liv...
100
Voted
CAD
2005
Springer
14 years 11 months ago
Optimizing the topological and combinatorial complexity of isosurfaces
Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of...
Carlos Andújar, Pere Brunet, Antoni Chica, ...
FUN
2010
Springer
312views Algorithms» more  FUN 2010»
15 years 4 months ago
On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching
Given a string s, the Parikh vector of s, denoted p(s), counts the multiplicity of each character in s. Searching for a match of Parikh vector q (a “jumbled string”) in the tex...
Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, ...
148
Voted
WWW
2007
ACM
16 years 12 days ago
Measuring semantic similarity between words using web search engines
Semantic similarity measures play important roles in information retrieval and Natural Language Processing. Previous work in semantic web-related applications such as community mi...
Danushka Bollegala, Yutaka Matsuo, Mitsuru Ishizuk...