Sciweavers

969 search results - page 63 / 194
» A New Metric Between Polygons and How to Compute it
Sort
View
COMPLEXITY
2006
144views more  COMPLEXITY 2006»
13 years 8 months ago
BML revisited: Statistical physics, computer simulation, and probability
Statistical physics, computer simulation and discrete mathematics are intimately related through the study of shared lattice models. These models lie at the foundation of all thre...
Raissa M. D'Souza
ASIAN
2006
Springer
134views Algorithms» more  ASIAN 2006»
14 years 16 days ago
Computational Soundness of Formal Indistinguishability and Static Equivalence
In the investigation of the relationship between the formal and the computational view of cryptography, a recent approach, first proposed in [10], uses static equivalence from cryp...
Gergei Bana, Payman Mohassel, Till Stegers
STOC
2009
ACM
182views Algorithms» more  STOC 2009»
14 years 9 months ago
Approximating edit distance in near-linear time
We show how to compute the edit distance between two strings of length n up to a factor of 2 ~O( log n) in n1+o(1) time. This is the first sub-polynomial approximation algorithm f...
Alexandr Andoni, Krzysztof Onak
ICASSP
2011
IEEE
13 years 15 days ago
An inner-product lower-bound estimate for dynamic time warping
In this paper, we present a lower-bound estimate for dynamic time warping (DTW) on time series consisting of multi-dimensional posterior probability vectors known as posteriorgram...
Yaodong Zhang, James R. Glass
MAM
2006
101views more  MAM 2006»
13 years 8 months ago
EPICURE: A partitioning and co-design framework for reconfigurable computing
This paper presents a new design methodology able to bridge the gap between an abstract specification and a heterogeneous recone architecture. The EPICURE contribution is the resu...
Jean-Philippe Diguet, Guy Gogniat, Jean Luc Philip...