, Snips: The ai platform for voice-enabled devices, 2017.
Blip: Non-interactive differentiallyprivate similarity computation on bloom filters, SSS, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00724829
Identifying global icebergs in distributed streams, SRDS, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01194511
Sketching for big data recommender systems using fast pseudo-random fingerprints, ICALP, 2013. ,
Gossiping personalized queries, EDBT, 2010. ,
URL : https://hal.archives-ouvertes.fr/inria-00455643
The gossple anonymous social network, 2010. ,
URL : https://hal.archives-ouvertes.fr/inria-00515693
Cover trees for nearest neighbor, ICML, 2006. ,
Hyrec: leveraging browsers for scalable recommenders, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01080016
Being prepared in a sparse world: the case of knn graph construction, ICDE, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01251010
On the resemblance and containment of documents, Compression and Complexity of Sequences, 1997. ,
Syntactic clustering of the web, Comp. Networks and ISDN Sys, 1997. ,
Runtime object lifetime profiler for latency sensitive big data applications, EuroSys, 2019. ,
Finding frequent items in data streams. Automata, languages and programming, 2002. ,
Similarity estimation techniques from rounding algorithms, STOC, 2002. ,
Fast approximate knn graph construction for high dimensional data via recursive lanczos bisection, J. of ML Research, 2009. ,
Friendship and mobility: User movement in location-based social networks, KDD, 2011. ,
An improved data stream summary: the count-min sketch and its applications, J. of Algorithms, vol.55, issue.1, 2005. ,
Exploring bit-difference for approximate knn search in high-dimensional databases, AusDM, 2005. ,
Efficient k-nearest neighbor graph construction for generic similarity measures, 2011. ,
Differential privacy: A survey of results, TAMC, 2008. ,
Employing bloom filters for privacy preserving distributed collaborative knn classification, WICT, 2011. ,
The movielens datasets: History and context, ACM Trans. Interact. Intell. Syst, 2015. ,
Approximate nearest neighbors: towards removing the curse of dimensionality, STOC, 1998. ,
Hash functions, Dr Dobbs Journal, 1997. ,
Lazybase: freshness vs. performance in information management, SIGOPS Op. Sys. Review, 2010. ,
Nobody cares if you liked star wars: KNN graph construction on the cheap, Euro-Par, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01867230
Exploring the tradeoff between performance and data freshness in database-driven web servers, The VLDB Journal, 2004. ,
Addressing cold-start problem in recommendation systems, IMCOM, 2008. ,
Lars: A location-aware recommender system, ICDE, 2012. ,
t-closeness: Privacy beyond k-anonymity and l-diversity, ICDE, 2007. ,
Theory and applications of b-bit minwise hashing, 2011. ,
Amazon. com recommendations: Item-to-item collaborative filtering, 2003. ,
An investigation of practical approximate nearest neighbor algorithms, Advances in neural information processing systems, 2004. ,
L-diversity: privacy beyond k-anonymity, ICDE, 2006. ,
, l-diversity: Privacy beyond k-anonymity. In ICDE, 2006.
From amateurs to connoisseurs: modeling the evolution of user expertise through online reviews, 2013. ,
Differentially private recommender systems: building privacy into the net, KDD, 2009. ,
The anchors hierarchy: Using the triangle inequality to survive high dimensional data, UAI, 2000. ,
Rapid aknn query processing for fast classification of multidimensional data in the cloud, CoRR, 2014. ,
Grouplens: an open architecture for collaborative filtering of netnews, 1994. ,
Augmented sketch: Faster and more accurate stream processing, SIGMOD, 2016. ,
Protecting respondents identities in microdata release, IEEE Trans. on Knowledge and Data Eng, 2001. ,
k-anonymity: A model for protecting privacy. International J. of Uncertainty, Fuzziness and Knowledge-Based Sys, 2002. ,
Information retrieval, 1979. ,
Efficient algorithms for k-anonymous location privacy in participatory sensing, INFOCOM, 2012. ,
Defining and evaluating network communities based on ground-truth. CoRR, abs/1205, vol.6233, 2012. ,