Sciweavers

1696 search results - page 48 / 340
» Permuted function matching
Sort
View
COMBINATORICS
2006
124views more  COMBINATORICS 2006»
14 years 10 months ago
A Hybrid of Darboux's Method and Singularity Analysis in Combinatorial Asymptotics
A "hybrid method", dedicated to asymptotic coefficient extraction in combinatorial generating functions, is presented, which combines Darboux's method and singulari...
Philippe Flajolet, Éric Fusy, Xavier Gourdo...
TOG
2012
273views Communications» more  TOG 2012»
13 years 14 days ago
Functional maps: a flexible representation of maps between shapes
We present a novel representation of maps between pairs of shapes that allows for efficient inference and manipulation. Key to our approach is a generalization of the notion of m...
Maks Ovsjanikov, Mirela Ben-Chen, Justin Solomon, ...
STOC
2002
ACM
177views Algorithms» more  STOC 2002»
15 years 10 months ago
Similarity estimation techniques from rounding algorithms
A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, PrhF [h(x) = h(y)] = si...
Moses Charikar
APCSAC
2004
IEEE
15 years 1 months ago
Validating Word-Oriented Processors for Bit and Multi-word Operations
We examine secure computing paradigms to identify any new architectural challenges for future general-purpose processors. Some essential security functions can be provided by diffe...
Ruby B. Lee, Xiao Yang, Zhijie Shi
ECIR
2008
Springer
14 years 11 months ago
Computing Information Retrieval Performance Measures Efficiently in the Presence of Tied Scores
Abstract. The Information Retrieval community uses a variety of performance measures to evaluate the effectiveness of scoring functions. In this paper, we show how to adapt six pop...
Frank McSherry, Marc Najork