Sciweavers

6393 search results - page 1000 / 1279
» Randomized Algorithms on the Mesh
Sort
View
156
Voted
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
16 years 5 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
136
Voted
RECOMB
2002
Springer
16 years 5 months ago
Revealing protein structures: a new method for mapping antibody epitopes
A recent idea for determining the three-dimensional structure of a protein uses antibody recognition of surface structure and random peptide libraries to map antibody epitope comb...
Brendan Mumey, Brian W. Bailey, Edward A. Dratz
STOC
2003
ACM
152views Algorithms» more  STOC 2003»
16 years 5 months ago
Cell-probe lower bounds for the partial match problem
Given a database of n points in {0, 1}d, the partial match problem is: In response to a query x in {0, 1, }d, find a database point y such that for every i whenever xi = , we have...
T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Raba...
SDM
2009
SIAM
157views Data Mining» more  SDM 2009»
16 years 1 months ago
MUSK: Uniform Sampling of k Maximal Patterns.
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
Mohammad Al Hasan, Mohammed Javeed Zaki
APPROX
2009
Springer
126views Algorithms» more  APPROX 2009»
15 years 11 months ago
Improved Inapproximability Results for Maximum k-Colorable Subgraph
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...
Venkatesan Guruswami, Ali Kemal Sinop
« Prev « First page 1000 / 1279 Last » Next »