Sciweavers

2924 search results - page 402 / 585
» Lower Bounds in Distributed Computing
Sort
View
CRYPTO
2008
Springer
75views Cryptology» more  CRYPTO 2008»
15 years 6 months ago
New Efficient Attacks on Statistical Disclosure Control Mechanisms
The goal of a statistical database is to provide statistics about a population while simultaneously protecting the privacy of the individual records in the database. The tension be...
Cynthia Dwork, Sergey Yekhanin
DRM
2008
Springer
15 years 6 months ago
A decision theoretic framework for analyzing binary hash-based content identification systems
Content identification has many applications, ranging from preventing illegal sharing of copyrighted content on video sharing websites, to automatic identification and tagging of ...
Avinash L. Varna, Ashwin Swaminathan, Min Wu
DAGSTUHL
2006
15 years 6 months ago
Efficient multi-step query processing for EMD-based similarity
Abstract. Similarity search in large multimedia databases requires efficient query processing based on suitable similarity models. Similarity models consist of a feature extraction...
Ira Assent, Thomas Seidl
ICASSP
2010
IEEE
15 years 5 months ago
Utilizing principal singular vectors for two-dimensional single frequency estimation
In this paper, frequency estimation of a twodimensional (2D) cisoid in the presence of additive white Gaussian noise is addressed. By utilizing the rank-one property of the 2D noi...
H. C. So, Frankie K. W. Chan, C. F. Chan, W. H. La...
169
Voted
ALGORITHMICA
2008
111views more  ALGORITHMICA 2008»
15 years 5 months ago
Fixed-Parameter Complexity of Minimum Profile Problems
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
Gregory Gutin, Stefan Szeider, Anders Yeo