Dan Vilenchik

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 20

Top Topics

Principal Component Analysis

Top Venues

Publications

Jake Barrett, Kobi Gal, Loizos Michael, Dan Vilenchik
Beyond the echo chamber: modelling open-mindedness in citizens' assemblies. Auton. Agents Multi Agent Syst. 38 (2) (2024)
Idan Weiss, Dan Vilenchik
Predicting Churn in Online Games by Quantifying Diversity of Engagement. Big Data 11 (4) (2023)
Yair Neuman, Vladyslav Kozhukhov, Dan Vilenchik
Data Augmentation for Modeling Human Personality: The Dexter Machine. CoRR (2023)
Kiril Danilchenko, Michael Segal, Dan Vilenchik
Opinion Spam Detection: A New Approach Using Machine Learning and Network-Based Algorithms. ICWSM (2022)
Roy Fairstein, Reshef Meir, Dan Vilenchik, Kobi Gal
Welfare vs. Representation in Participatory Budgeting. CoRR (2022)
Roy Fairstein, Dan Vilenchik, Reshef Meir, Kobi Gal
Welfare vs. Representation in Participatory Budgeting. AAMAS (2022)
Michael Sidorov, Dan Vilenchik
Revisiting Information Cascades in Online Social Networks. CoRR (2022)
Kiril Danilchenko, Michael Segal, Dan Vilenchik
Opinion Spam Detection: A New Approach Using Machine Learning and Network-Based Algorithms. CoRR (2022)
Ilan Tal, Dan Vilenchik
HARALD: Augmenting Hate Speech Data Sets with Real Data. EMNLP (Findings) (2022)
Ron Korenblum Pick, Vladyslav Kozhukhov, Dan Vilenchik, Oren Tsur
STEM: Unsupervised STructural EMbedding for Stance Detection. AAAI (2022)
Ron Korenblum Pick, Vladyslav Kozhukhov, Dan Vilenchik, Oren Tsur
STEM: Unsupervised STructural EMbedding for Stance Detection. CoRR (2021)
Dan Vilenchik
Simple Statistics Are Sometime Too Simple: A Case Study in Social Media Data. IEEE Trans. Knowl. Data Eng. 32 (2) (2020)
Haviv Hershcovits, Dan Vilenchik, Kobi Gal
Modeling Engagement in Self-Directed Learning Systems Using Principal Component Analysis. IEEE Trans. Learn. Technol. 13 (1) (2020)
Guy Holtzman, Adam Soffer, Dan Vilenchik
A Greedy Anytime Algorithm for Sparse PCA. COLT (2020)
Yair Neuman, Dan Vilenchik
Modeling Small Systems Through the Relative Entropy Lattice. IEEE Access 7 (2019)
Guy Holtzman, Adam Soffer, Dan Vilenchik
A greedy anytime algorithm for sparse PCA. CoRR (2019)
Dan Vilenchik, Barak Yichye, Maor Abutbul
To Interpret or Not to Interpret PCA? This Is Our Question. ICWSM (2019)
Yair Neuman, Navot Israeli, Dan Vilenchik, Yochai Cohen
The Adaptive Behavior of a Soccer Team: An Entropy-Based Analysis. Entropy 20 (10) (2018)
Dan Vilenchik
The Million Tweets Fallacy: Activity and Feedback Are Uncorrelated. ICWSM (2018)
Yoram Segal, Dan Vilenchik, Ofer Hadar
Detecting and Coloring Anomalies in Real Cellular Network Using Principle Component Analysis. CSCML (2018)
Victor Bapst, Amin Coja-Oghlan, Samuel Hetterich, Felicia Raßmann, Dan Vilenchik
The Condensation Phase Transition in Random Graph Coloring. APPROX-RANDOM (2014)
Victor Bapst, Amin Coja-Oghlan, Samuel Hetterich, Felicia Raßmann, Dan Vilenchik
The condensation phase transition in random graph coloring. CoRR (2014)
Amin Coja-Oghlan, Dan Vilenchik
Chasing the K-Colorability Threshold. FOCS (2013)
Vladimir Braverman, Rafail Ostrovsky, Dan Vilenchik
How Hard Is Counting Triangles in the Streaming Model? ICALP (1) (2013)
Amin Coja-Oghlan, Dan Vilenchik
Chasing the k-colorability threshold CoRR (2013)
Ilia Levi, Dan Vilenchik, Michael Langberg, Michelle Effros
Zero vs. ε error in interference channels. ITW (2013)
Uriel Feige, Elchanan Mossel, Dan Vilenchik
Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems. Theory Comput. 9 (2013)
Alistair Sinclair, Dan Vilenchik
Delaying satisfiability for random 2SAT. Random Struct. Algorithms 43 (2) (2013)
Vladimir Braverman, Rafail Ostrovsky, Dan Vilenchik
How Hard is Counting Triangles in the Streaming Model CoRR (2013)
Ilia Levi, Dan Vilenchik, Michael Langberg, Michelle Effros
Zero vs. epsilon Error in Interference Channels. CoRR (2013)
Igor Pak, Dan Vilenchik
Constructing Uniquely Realizable Graphs. Discret. Comput. Geom. 50 (4) (2013)
Michael Langberg, Dan Vilenchik
Edge distribution in generalized graph products CoRR (2012)
Choongbum Lee, Benny Sudakov, Dan Vilenchik
Getting a Directed Hamilton Cycle Two Times Faster. Comb. Probab. Comput. 21 (5) (2012)
Uriel Feige, Abraham D. Flaxman, Dan Vilenchik
-CNF Formulas. SIAM J. Discret. Math. 25 (2) (2011)
Tobias Friedrich, Thomas Sauerwald, Dan Vilenchik
Smoothed analysis of balancing networks. Random Struct. Algorithms 39 (1) (2011)
Tobias Friedrich, Thomas Sauerwald, Dan Vilenchik
Smoothed Analysis of Balancing Networks CoRR (2010)
Amin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik
-Colorable Graphs Are Easy to Color. Theory Comput. Syst. 46 (3) (2010)
Alistair Sinclair, Dan Vilenchik
Delaying Satisfiability for Random 2SAT. APPROX-RANDOM (2010)
Tobias Friedrich, Thomas Sauerwald, Dan Vilenchik
Smoothed Analysis of Balancing Networks. ICALP (2) (2009)
Amin Coja-Oghlan, Uriel Feige, Alan M. Frieze, Michael Krivelevich, Dan Vilenchik
-CNF formulas and the Walksat algorithm. SODA (2009)
Amin Coja-Oghlan, Elchanan Mossel, Dan Vilenchik
A Spectral Approach to Analysing Belief Propagation for 3-Colouring. Comb. Probab. Comput. 18 (6) (2009)
Michael Krivelevich, Benny Sudakov, Dan Vilenchik
On the Random Satisfiable Process. Comb. Probab. Comput. 18 (5) (2009)
Lorenz Minder, Dan Vilenchik
Small Clique Detection and Approximate Nash Equilibria. APPROX-RANDOM (2009)
Michael Krivelevich, Benny Sudakov, Dan Vilenchik
On the random satisfiable process CoRR (2008)
Julia Böttcher, Dan Vilenchik
On the tractability of coloring semirandom graphs. Inf. Process. Lett. 108 (3) (2008)
Amin Coja-Oghlan, Elchanan Mossel, Dan Vilenchik
A Spectral Approach to Analyzing Belief Propagation for 3-Coloring CoRR (2007)
Amin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik
-Colorable Graphs Are Easy. STACS (2007)
Sonny Ben-Shimon, Dan Vilenchik
Message passing for the coloring problem: Gallager meets Alon and Kahale. CoRR (2007)
Dan Vilenchik
It's All about the Support: A New Perspective on the Satisfiability Problem. J. Satisf. Boolean Model. Comput. 3 (3-4) (2007)
Michael Krivelevich, Dan Vilenchik
Semirandom Models as Benchmarks for Coloring Algorithms. ANALCO (2006)
Uriel Feige, Elchanan Mossel, Dan Vilenchik
Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems. APPROX-RANDOM (2006)
Michael Krivelevich, Dan Vilenchik
Solving random satisfiable 3CNF formulas in expected polynomial time. SODA (2006)