Dan Vilenchik

Big Data, August, 2023

Data Augmentation for Modeling Human Personality: The Dexter Machine.

[BibT_eX]

[DOI]

Yair Neuman

Vladyslav Kozhukhov

CoRR, 2023

2022

Revisiting Information Cascades in Online Social Networks.

[BibT_eX]

[DOI]

Michael Sidorov

CoRR, 2022

Opinion Spam Detection: A New Approach Using Machine Learning and Network-Based Algorithms.

[BibT_eX]

[DOI]

Kiril Danilchenko

Michael Segal

Proceedings of the Sixteenth International AAAI Conference on Web and Social Media, 2022

HARALD: Augmenting Hate Speech Data Sets with Real Data.

[BibT_eX]

[DOI]

Ilan Tal

Proceedings of the Findings of the Association for Computational Linguistics: EMNLP 2022, 2022

Welfare vs. Representation in Participatory Budgeting.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

STEM: Unsupervised STructural EMbedding for Stance Detection.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2020

Modeling Engagement in Self-Directed Learning Systems Using Principal Component Analysis.

[BibT_eX]

[DOI]

Haviv Hershcovits

Kobi Gal

IEEE Trans. Learn. Technol., 2020

Simple Statistics Are Sometime Too Simple: A Case Study in Social Media Data.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2020

A Greedy Anytime Algorithm for Sparse PCA.

[BibT_eX]

[DOI]

Guy Holtzman

Adam Soffer

Proceedings of the Conference on Learning Theory, 2020

2019

Modeling Small Systems Through the Relative Entropy Lattice.

[BibT_eX]

[DOI]

Yair Neuman

IEEE Access, 2019

To Interpret or Not to Interpret PCA? This Is Our Question.

[BibT_eX]

[DOI]

Barak Yichye

Maor Abutbul

Proceedings of the Thirteenth International Conference on Web and Social Media, 2019

2018

The Adaptive Behavior of a Soccer Team: An Entropy-Based Analysis.

[BibT_eX]

[DOI]

Entropy, 2018

The Million Tweets Fallacy: Activity and Feedback Are Uncorrelated.

[BibT_eX]

[DOI]

Proceedings of the Twelfth International Conference on Web and Social Media, 2018

Detecting and Coloring Anomalies in Real Cellular Network Using Principle Component Analysis.

[BibT_eX]

[DOI]

Yoram Segal

Ofer Hadar

Proceedings of the Cyber Security Cryptography and Machine Learning, 2018

2014

The Condensation Phase Transition in Random Graph Coloring.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2014

2013

Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems.

[BibT_eX]

[DOI]

Uriel Feige

Elchanan Mossel

Theory Comput., 2013

Delaying satisfiability for random 2SAT.

[BibT_eX]

[DOI]

Alistair Sinclair

Random Struct. Algorithms, 2013

Constructing Uniquely Realizable Graphs.

[BibT_eX]

[DOI]

Igor Pak

Discret. Comput. Geom., 2013

Zero vs. epsilon Error in Interference Channels.

[BibT_eX]

[DOI]

CoRR, 2013

Zero vs. ε error in interference channels.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE Information Theory Workshop, 2013

How Hard Is Counting Triangles in the Streaming Model?

[BibT_eX]

[DOI]

Vladimir Braverman

Rafail Ostrovsky

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Chasing the K-Colorability Threshold.

[BibT_eX]

[DOI]

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012

Getting a Directed Hamilton Cycle Two Times Faster.

[BibT_eX]

[DOI]

Choongbum Lee

Benny Sudakov

Comb. Probab. Comput., 2012

Edge distribution in generalized graph products

[BibT_eX]

[DOI]

Michael Langberg

CoRR, 2012

2011

On the Diameter of the Set of Satisfying Assignments in Random Satisfiable k-CNF Formulas.

[BibT_eX]

[DOI]

Uriel Feige

Abraham D. Flaxman

SIAM J. Discret. Math., 2011

Smoothed analysis of balancing networks.

[BibT_eX]

[DOI]

Tobias Friedrich

Thomas Sauerwald

Random Struct. Algorithms, 2011

2010

Why Almost All k-Colorable Graphs Are Easy to Color.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2010

2009

On the Random Satisfiable Process.

[BibT_eX]

[DOI]

Benny Sudakov

Comb. Probab. Comput., 2009

A Spectral Approach to Analysing Belief Propagation for 3-Colouring.

[BibT_eX]

[DOI]

Elchanan Mossel

Comb. Probab. Comput., 2009

On smoothed k-CNF formulas and the Walksat algorithm.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Small Clique Detection and Approximate Nash Equilibria.

[BibT_eX]

[DOI]

Lorenz Minder

Proceedings of the Approximation, 2009

2008

A rigorous study of some satisfiability problems

[BibT_eX]

[DOI]

PhD thesis, 2008

On the tractability of coloring semirandom graphs.

[BibT_eX]

[DOI]

Julia Böttcher

Inf. Process. Lett., 2008

2007

It's All about the Support: A New Perspective on the Satisfiability Problem.

[BibT_eX]

[DOI]

J. Satisf. Boolean Model. Comput., 2007

A Spectral Approach to Analyzing Belief Propagation for 3-Coloring

[BibT_eX]

[DOI]

Elchanan Mossel

CoRR, 2007

Message passing for the coloring problem: Gallager meets Alon and Kahale.

[BibT_eX]

[DOI]

Sonny Ben-Shimon

CoRR, 2007

Why Almost All k -Colorable Graphs Are Easy.

[BibT_eX]

[DOI]

Proceedings of the STACS 2007, 2007

2006

Solving random satisfiable 3CNF formulas in expected polynomial time.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Semirandom Models as Benchmarks for Coloring Algorithms.

[BibT_eX]

[DOI]