Sciweavers

1640 search results - page 250 / 328
» Deriving Private Information from Randomized Data
Sort
View
PODS
2009
ACM
134views Database» more  PODS 2009»
15 years 10 months ago
An efficient rigorous approach for identifying statistically significant frequent itemsets
As advances in technology allow for the collection, storage, and analysis of vast amounts of data, the task of screening and assessing the significance of discovered patterns is b...
Adam Kirsch, Michael Mitzenmacher, Andrea Pietraca...
CCS
2006
ACM
15 years 1 months ago
Finding the original point set hidden among chaff
In biometric identification, a fingerprint is typically represented as a set of minutiae which are 2D points. A method [4] to protect the fingerprint template hides the minutiae b...
Ee-Chien Chang, Ren Shen, Francis Weijian Teo
INFOCOM
1989
IEEE
15 years 1 months ago
An Efficient Multiple-Access Method for the Binary Adder Channel
Consider M - HChoose P - T communications: T users or less, out of M potential users, are chosen at random to simultaneously transmit binary data over a common channel. A method f...
Israel Bar-David, Eli Plotnik, Raphael Rom
JDWM
2010
180views more  JDWM 2010»
14 years 8 months ago
Investigating the Properties of a Social Bookmarking and Tagging Network
Social networks and collaborative tagging systems are rapidly gaining popularity as a primary means for storing and sharing data among friends, family, colleagues, or perfect stra...
Ralitsa Angelova, Marek Lipczak, Evangelos E. Mili...
CIKM
1993
Springer
15 years 2 months ago
Collection Oriented Match
match algorithms that can efficiently handleAbstract complex tests in the presence of large amounts of data. Match algorithms that are capable of handling large amounts of On the o...
Anurag Acharya, Milind Tambe