Sciweavers

1208 search results - page 200 / 242
» On Counting Generalized Colorings
Sort
View
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
14 years 9 months ago
Universally utility-maximizing privacy mechanisms
A mechanism for releasing information about a statistical database with sensitive data must resolve a trade-off between utility and privacy. Publishing fully accurate information ...
Arpita Ghosh, Tim Roughgarden, Mukund Sundararajan
KDD
2009
ACM
169views Data Mining» more  KDD 2009»
14 years 9 months ago
COA: finding novel patents through text analysis
In recent years, the number of patents filed by the business enterprises in the technology industry are growing rapidly, thus providing unprecedented opportunities for knowledge d...
Mohammad Al Hasan, W. Scott Spangler, Thomas D. Gr...
KDD
2003
ACM
129views Data Mining» more  KDD 2003»
14 years 9 months ago
Empirical comparisons of various voting methods in bagging
Finding effective methods for developing an ensemble of models has been an active research area of large-scale data mining in recent years. Models learned from data are often subj...
Kelvin T. Leung, Douglas Stott Parker Jr.
RECOMB
2002
Springer
14 years 9 months ago
DNA sequence evolution with neighbor-dependent mutation
We introduce a model of DNA sequence evolution which can account for biases in mutation rates that depend on the identity of the neighboring bases. An analytic solution for this c...
Peter F. Arndt, Christopher B. Burge, Terence Hwa
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
14 years 9 months ago
Lower bounds for randomized read/write stream algorithms
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
Paul Beame, T. S. Jayram, Atri Rudra