Sciweavers

4850 search results - page 154 / 970
» Approximate Data Structures with Applications
Sort
View
115
Voted
SODA
2010
ACM
202views Algorithms» more  SODA 2010»
15 years 10 months ago
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
Timothy M. Chan, Mihai Patrascu
129
Voted
PODS
2008
ACM
250views Database» more  PODS 2008»
16 years 1 months ago
Approximating predicates and expressive queries on probabilistic databases
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
Christoph Koch
FC
2005
Springer
110views Cryptology» more  FC 2005»
15 years 6 months ago
Approximate Message Authentication and Biometric Entity Authentication
Approximate Message Authentication Code (AMAC) is a recently introduced cryptographic primitive with several applications in the areas of cryptography and coding theory. Briefly s...
Giovanni Di Crescenzo, R. F. Graveman, Renwei Ge, ...
99
Voted
SWAT
2004
Springer
98views Algorithms» more  SWAT 2004»
15 years 6 months ago
Tight Approximability Results for Test Set Problems in Bioinformatics
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao
RECOMB
2004
Springer
16 years 1 months ago
Finding approximate tandem repeats in genomic sequences
An efficient algorithm is presented for detecting approximate tandem repeats in genomic sequences. The algorithm is based on a flexible statistical model which allows a wide range...
Ydo Wexler, Zohar Yakhini, Yechezkel Kashi, Dan Ge...