Sciweavers

1257 search results - page 102 / 252
» A generalization of Euler's constant
Sort
View
ICCV
2011
IEEE
13 years 9 days ago
Fast Template Matching in Non-Linear Tone-Mapped Images
We propose a fast pattern matching scheme termed Matching by Tone Mapping (MTM) which allows matching under non-linear tone mappings. We show that, when tone mapping is approximate...
Yacov Hel-Or, Hagit Hel-Or and Eyal David
PLDI
2012
ACM
12 years 15 days ago
Scalable and precise dynamic datarace detection for structured parallelism
Existing dynamic race detectors suffer from at least one of the following three limitations: (i) space overhead per memory location grows linearly with the number of parallel thre...
Raghavan Raman, Jisheng Zhao, Vivek Sarkar, Martin...
CRYPTO
2012
Springer
277views Cryptology» more  CRYPTO 2012»
12 years 15 days ago
Multiparty Computation from Somewhat Homomorphic Encryption
We propose a general multiparty computation protocol secure against an active adversary corrupting up to n−1 of the n players. The protocol may be used to compute securely arithm...
Ivan Damgård, Valerio Pastro, Nigel P. Smart...
SODA
2012
ACM
249views Algorithms» more  SODA 2012»
12 years 15 days ago
Improved competitive ratio for the matroid secretary problem
The Matroid Secretary Problem, introduced by Babaioff et al. (2007), is a generalization of the Classical Secretary Problem. In this problem, elements from a matroid are presente...
Sourav Chakraborty, Oded Lachish
PODS
2008
ACM
159views Database» more  PODS 2008»
14 years 10 months ago
Approximation algorithms for clustering uncertain data
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
Graham Cormode, Andrew McGregor