Sciweavers

4886 search results - page 823 / 978
» Approximate Data Exchange
Sort
View
RECOMB
2003
Springer
14 years 11 months ago
Maximum entropy modeling of short sequence motifs with applications to RNA splicing signals
We propose a framework for modeling sequence motifs based on the maximum entropy principle (MEP). We recommend approximating short sequence motif distributions with the maximum en...
Gene W. Yeo, Christopher B. Burge
STOC
2003
ACM
142views Algorithms» more  STOC 2003»
14 years 11 months ago
Optimal probabilistic fingerprint codes
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
Gábor Tardos
ICALP
2009
Springer
14 years 11 months ago
Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams
Estimating frequency moments and Lp distances are well studied problems in the adversarial data stream model and tight space bounds are known for these two problems. There has been...
Sudipto Guha, Zhiyi Huang
VLDB
2007
ACM
159views Database» more  VLDB 2007»
14 years 11 months ago
Example-driven design of efficient record matching queries
Record matching is the task of identifying records that match the same real world entity. This is a problem of great significance for a variety of business intelligence applicatio...
Surajit Chaudhuri, Bee-Chung Chen, Venkatesh Ganti...
SIGMOD
2006
ACM
137views Database» more  SIGMOD 2006»
14 years 10 months ago
Optimal multi-scale patterns in time series streams
We introduce a method to discover optimal local patterns, which concisely describe the main trends in a time series. Our approach examines the time series at multiple time scales ...
Spiros Papadimitriou, Philip S. Yu